./Ultimate.py --spec /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/properties/unreach-call.prp --file /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/mnt/thread-witnesses/replication/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/thread-witnesses/replication/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/thread-witnesses/replication/UAutomizer-linux/data -tc /mnt/thread-witnesses/replication/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i -s /mnt/thread-witnesses/replication/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/thread-witnesses/replication/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-02-16 10:47:10,705 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-02-16 10:47:10,720 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-02-16 10:47:10,745 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-02-16 10:47:10,759 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-02-16 10:47:10,762 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-02-16 10:47:10,763 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-02-16 10:47:10,765 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-02-16 10:47:10,766 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-02-16 10:47:10,769 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-02-16 10:47:10,770 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-02-16 10:47:10,772 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-02-16 10:47:10,772 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-02-16 10:47:10,774 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-02-16 10:47:10,776 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-02-16 10:47:10,777 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-02-16 10:47:10,778 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-02-16 10:47:10,779 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-02-16 10:47:10,780 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-02-16 10:47:10,785 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-02-16 10:47:10,786 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-02-16 10:47:10,790 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-02-16 10:47:10,791 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-02-16 10:47:10,792 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-02-16 10:47:10,811 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-02-16 10:47:10,811 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-02-16 10:47:10,811 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-02-16 10:47:10,812 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-02-16 10:47:10,813 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-02-16 10:47:10,814 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-02-16 10:47:10,815 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-02-16 10:47:10,815 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-02-16 10:47:10,816 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-02-16 10:47:10,817 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-02-16 10:47:10,818 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-02-16 10:47:10,818 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-02-16 10:47:10,818 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-02-16 10:47:10,818 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-02-16 10:47:10,819 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-02-16 10:47:10,819 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-02-16 10:47:10,819 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-02-16 10:47:10,821 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/thread-witnesses/replication/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2023-02-16 10:47:10,857 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-02-16 10:47:10,858 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-02-16 10:47:10,858 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-02-16 10:47:10,858 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-02-16 10:47:10,859 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-02-16 10:47:10,859 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-02-16 10:47:10,859 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-02-16 10:47:10,859 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-02-16 10:47:10,860 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-02-16 10:47:10,860 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-02-16 10:47:10,860 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-02-16 10:47:10,860 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-02-16 10:47:10,860 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-02-16 10:47:10,860 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-02-16 10:47:10,861 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-02-16 10:47:10,861 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-02-16 10:47:10,861 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-02-16 10:47:10,861 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-02-16 10:47:10,861 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-02-16 10:47:10,861 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-02-16 10:47:10,862 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-02-16 10:47:10,862 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-02-16 10:47:10,862 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-02-16 10:47:10,862 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-02-16 10:47:10,862 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-02-16 10:47:10,862 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-02-16 10:47:10,863 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-02-16 10:47:10,864 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/thread-witnesses/replication/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/thread-witnesses/replication/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6
[2023-02-16 10:47:11,809 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-02-16 10:47:11,852 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-02-16 10:47:11,854 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-02-16 10:47:11,855 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-02-16 10:47:11,856 INFO  L275        PluginConnector]: CDTParser initialized
[2023-02-16 10:47:11,857 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i
[2023-02-16 10:47:15,179 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-02-16 10:47:15,480 INFO  L351              CDTParser]: Found 1 translation units.
[2023-02-16 10:47:15,480 INFO  L172              CDTParser]: Scanning /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i
[2023-02-16 10:47:15,486 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/thread-witnesses/replication/UAutomizer-linux/data/d30c80d42/1226636bff5941178ff30dcc3e297934/FLAG7eec54a93
[2023-02-16 10:47:15,507 INFO  L402              CDTParser]: Successfully deleted /mnt/thread-witnesses/replication/UAutomizer-linux/data/d30c80d42/1226636bff5941178ff30dcc3e297934
[2023-02-16 10:47:15,510 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-02-16 10:47:15,518 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-02-16 10:47:15,537 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-02-16 10:47:15,537 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-02-16 10:47:15,541 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-02-16 10:47:15,541 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,542 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f460d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15, skipping insertion in model container
[2023-02-16 10:47:15,542 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,549 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-02-16 10:47:15,581 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-02-16 10:47:15,772 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i[804,817]
[2023-02-16 10:47:15,781 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-02-16 10:47:15,801 INFO  L203         MainTranslator]: Completed pre-run
[2023-02-16 10:47:15,817 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /mnt/thread-witnesses/replication/bench/thread-witnesses/st-lit/prec/bh-ex1-poly.i[804,817]
[2023-02-16 10:47:15,832 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-02-16 10:47:15,842 INFO  L208         MainTranslator]: Completed translation
[2023-02-16 10:47:15,845 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15 WrapperNode
[2023-02-16 10:47:15,845 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-02-16 10:47:15,846 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-02-16 10:47:15,846 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-02-16 10:47:15,846 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-02-16 10:47:15,876 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,882 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,907 INFO  L138                Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34
[2023-02-16 10:47:15,908 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-02-16 10:47:15,908 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-02-16 10:47:15,908 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-02-16 10:47:15,909 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-02-16 10:47:15,914 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,927 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,935 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,936 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,943 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,946 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,947 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,948 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,952 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-02-16 10:47:15,954 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-02-16 10:47:15,954 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-02-16 10:47:15,955 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-02-16 10:47:15,956 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (1/1) ...
[2023-02-16 10:47:15,960 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-02-16 10:47:15,975 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/thread-witnesses/replication/UAutomizer-linux/z3
[2023-02-16 10:47:15,996 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/thread-witnesses/replication/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-02-16 10:47:16,001 INFO  L327       MonitoredProcess]: [MP /mnt/thread-witnesses/replication/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-02-16 10:47:16,084 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-02-16 10:47:16,084 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-02-16 10:47:16,084 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-02-16 10:47:16,084 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-02-16 10:47:16,085 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2023-02-16 10:47:16,085 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2023-02-16 10:47:16,154 INFO  L235             CfgBuilder]: Building ICFG
[2023-02-16 10:47:16,156 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-02-16 10:47:16,316 INFO  L276             CfgBuilder]: Performing block encoding
[2023-02-16 10:47:16,329 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-02-16 10:47:16,329 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-02-16 10:47:16,331 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 10:47:16 BoogieIcfgContainer
[2023-02-16 10:47:16,334 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-02-16 10:47:16,341 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-02-16 10:47:16,341 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-02-16 10:47:16,396 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-02-16 10:47:16,396 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 10:47:15" (1/3) ...
[2023-02-16 10:47:16,401 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d36fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 10:47:16, skipping insertion in model container
[2023-02-16 10:47:16,402 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 10:47:15" (2/3) ...
[2023-02-16 10:47:16,404 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d36fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 10:47:16, skipping insertion in model container
[2023-02-16 10:47:16,404 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 10:47:16" (3/3) ...
[2023-02-16 10:47:16,406 INFO  L112   eAbstractionObserver]: Analyzing ICFG bh-ex1-poly.i
[2023-02-16 10:47:16,427 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-02-16 10:47:16,427 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-02-16 10:47:16,520 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-02-16 10:47:16,533 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6bb522a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-02-16 10:47:16,534 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-02-16 10:47:16,537 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-02-16 10:47:16,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-02-16 10:47:16,543 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:16,546 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:16,547 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:16,552 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:16,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 300894425, now seen corresponding path program 1 times
[2023-02-16 10:47:16,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:16,560 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536804965]
[2023-02-16 10:47:16,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:16,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:16,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:16,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-02-16 10:47:16,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:16,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536804965]
[2023-02-16 10:47:16,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536804965] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:16,958 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:16,959 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-02-16 10:47:16,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688205875]
[2023-02-16 10:47:16,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:16,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-02-16 10:47:16,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:17,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-02-16 10:47:17,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-02-16 10:47:17,041 INFO  L87              Difference]: Start difference. First operand  has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-02-16 10:47:17,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:17,149 INFO  L93              Difference]: Finished difference Result 45 states and 77 transitions.
[2023-02-16 10:47:17,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-02-16 10:47:17,151 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2023-02-16 10:47:17,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:17,156 INFO  L225             Difference]: With dead ends: 45
[2023-02-16 10:47:17,162 INFO  L226             Difference]: Without dead ends: 20
[2023-02-16 10:47:17,173 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-02-16 10:47:17,176 INFO  L413           NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:17,180 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-02-16 10:47:17,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2023-02-16 10:47:17,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2023-02-16 10:47:17,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-02-16 10:47:17,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions.
[2023-02-16 10:47:17,248 INFO  L78                 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8
[2023-02-16 10:47:17,248 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:17,248 INFO  L495      AbstractCegarLoop]: Abstraction has 20 states and 28 transitions.
[2023-02-16 10:47:17,249 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-02-16 10:47:17,249 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions.
[2023-02-16 10:47:17,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-02-16 10:47:17,250 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:17,251 INFO  L195           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:17,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-02-16 10:47:17,251 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:17,253 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:17,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 302503139, now seen corresponding path program 1 times
[2023-02-16 10:47:17,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:17,254 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820575469]
[2023-02-16 10:47:17,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:17,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:17,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:17,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-02-16 10:47:17,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:17,490 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820575469]
[2023-02-16 10:47:17,490 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820575469] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:17,490 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:17,491 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-02-16 10:47:17,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114244870]
[2023-02-16 10:47:17,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:17,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-02-16 10:47:17,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:17,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-02-16 10:47:17,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-02-16 10:47:17,493 INFO  L87              Difference]: Start difference. First operand 20 states and 28 transitions. Second operand  has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-02-16 10:47:17,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:17,648 INFO  L93              Difference]: Finished difference Result 27 states and 34 transitions.
[2023-02-16 10:47:17,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-02-16 10:47:17,649 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2023-02-16 10:47:17,649 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:17,650 INFO  L225             Difference]: With dead ends: 27
[2023-02-16 10:47:17,650 INFO  L226             Difference]: Without dead ends: 25
[2023-02-16 10:47:17,650 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-02-16 10:47:17,662 INFO  L413           NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:17,664 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-02-16 10:47:17,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2023-02-16 10:47:17,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24.
[2023-02-16 10:47:17,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2023-02-16 10:47:17,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions.
[2023-02-16 10:47:17,695 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8
[2023-02-16 10:47:17,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:17,696 INFO  L495      AbstractCegarLoop]: Abstraction has 24 states and 31 transitions.
[2023-02-16 10:47:17,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-02-16 10:47:17,696 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions.
[2023-02-16 10:47:17,697 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2023-02-16 10:47:17,698 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:17,699 INFO  L195           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:17,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-02-16 10:47:17,700 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:17,700 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:17,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 1964350918, now seen corresponding path program 1 times
[2023-02-16 10:47:17,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:17,702 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785368604]
[2023-02-16 10:47:17,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:17,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:17,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:17,871 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:17,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:17,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-02-16 10:47:17,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:17,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785368604]
[2023-02-16 10:47:17,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785368604] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:17,906 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:17,906 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-02-16 10:47:17,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013817980]
[2023-02-16 10:47:17,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:17,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-02-16 10:47:17,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:17,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-02-16 10:47:17,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-02-16 10:47:17,911 INFO  L87              Difference]: Start difference. First operand 24 states and 31 transitions. Second operand  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-02-16 10:47:18,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:18,097 INFO  L93              Difference]: Finished difference Result 42 states and 57 transitions.
[2023-02-16 10:47:18,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-02-16 10:47:18,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13
[2023-02-16 10:47:18,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:18,101 INFO  L225             Difference]: With dead ends: 42
[2023-02-16 10:47:18,101 INFO  L226             Difference]: Without dead ends: 40
[2023-02-16 10:47:18,105 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2023-02-16 10:47:18,108 INFO  L413           NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:18,110 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 112 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-02-16 10:47:18,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2023-02-16 10:47:18,126 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37.
[2023-02-16 10:47:18,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-02-16 10:47:18,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions.
[2023-02-16 10:47:18,131 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13
[2023-02-16 10:47:18,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:18,131 INFO  L495      AbstractCegarLoop]: Abstraction has 37 states and 50 transitions.
[2023-02-16 10:47:18,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-02-16 10:47:18,147 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions.
[2023-02-16 10:47:18,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2023-02-16 10:47:18,148 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:18,149 INFO  L195           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:18,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-02-16 10:47:18,149 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:18,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:18,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -1092746621, now seen corresponding path program 1 times
[2023-02-16 10:47:18,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:18,150 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057011431]
[2023-02-16 10:47:18,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:18,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:18,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,317 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:18,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,331 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2023-02-16 10:47:18,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2023-02-16 10:47:18,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:18,336 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057011431]
[2023-02-16 10:47:18,336 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057011431] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:18,336 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:18,336 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-02-16 10:47:18,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593369692]
[2023-02-16 10:47:18,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:18,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-02-16 10:47:18,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:18,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-02-16 10:47:18,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-02-16 10:47:18,338 INFO  L87              Difference]: Start difference. First operand 37 states and 50 transitions. Second operand  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-02-16 10:47:18,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:18,460 INFO  L93              Difference]: Finished difference Result 46 states and 60 transitions.
[2023-02-16 10:47:18,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-02-16 10:47:18,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2023-02-16 10:47:18,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:18,462 INFO  L225             Difference]: With dead ends: 46
[2023-02-16 10:47:18,462 INFO  L226             Difference]: Without dead ends: 44
[2023-02-16 10:47:18,463 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2023-02-16 10:47:18,469 INFO  L413           NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:18,471 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-02-16 10:47:18,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2023-02-16 10:47:18,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42.
[2023-02-16 10:47:18,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15)
[2023-02-16 10:47:18,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions.
[2023-02-16 10:47:18,500 INFO  L78                 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18
[2023-02-16 10:47:18,500 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:18,500 INFO  L495      AbstractCegarLoop]: Abstraction has 42 states and 55 transitions.
[2023-02-16 10:47:18,500 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-02-16 10:47:18,501 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions.
[2023-02-16 10:47:18,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2023-02-16 10:47:18,502 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:18,502 INFO  L195           NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:18,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-02-16 10:47:18,502 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:18,503 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:18,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 961880998, now seen corresponding path program 1 times
[2023-02-16 10:47:18,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:18,519 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743515703]
[2023-02-16 10:47:18,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:18,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:18,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,624 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:18,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,644 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2023-02-16 10:47:18,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,651 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2023-02-16 10:47:18,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,655 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-02-16 10:47:18,655 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:18,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743515703]
[2023-02-16 10:47:18,655 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743515703] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:18,656 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:18,656 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-02-16 10:47:18,656 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96887396]
[2023-02-16 10:47:18,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:18,657 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-02-16 10:47:18,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:18,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-02-16 10:47:18,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-02-16 10:47:18,658 INFO  L87              Difference]: Start difference. First operand 42 states and 55 transitions. Second operand  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2023-02-16 10:47:18,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:18,750 INFO  L93              Difference]: Finished difference Result 89 states and 120 transitions.
[2023-02-16 10:47:18,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-02-16 10:47:18,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2023-02-16 10:47:18,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:18,755 INFO  L225             Difference]: With dead ends: 89
[2023-02-16 10:47:18,756 INFO  L226             Difference]: Without dead ends: 56
[2023-02-16 10:47:18,756 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-02-16 10:47:18,757 INFO  L413           NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:18,758 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-02-16 10:47:18,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2023-02-16 10:47:18,777 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2023-02-16 10:47:18,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23)
[2023-02-16 10:47:18,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions.
[2023-02-16 10:47:18,783 INFO  L78                 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 23
[2023-02-16 10:47:18,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:18,783 INFO  L495      AbstractCegarLoop]: Abstraction has 56 states and 76 transitions.
[2023-02-16 10:47:18,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2023-02-16 10:47:18,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions.
[2023-02-16 10:47:18,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2023-02-16 10:47:18,799 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:18,799 INFO  L195           NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:18,800 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-02-16 10:47:18,800 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:18,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:18,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962382770, now seen corresponding path program 1 times
[2023-02-16 10:47:18,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:18,801 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544044142]
[2023-02-16 10:47:18,801 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:18,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:18,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,913 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:18,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,915 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2023-02-16 10:47:18,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,918 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2023-02-16 10:47:18,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,921 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2023-02-16 10:47:18,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,923 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2023-02-16 10:47:18,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,929 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-02-16 10:47:18,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,949 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-02-16 10:47:18,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:18,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2023-02-16 10:47:18,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:18,952 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544044142]
[2023-02-16 10:47:18,953 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544044142] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:18,953 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:18,953 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-02-16 10:47:18,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550001172]
[2023-02-16 10:47:18,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:18,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-02-16 10:47:18,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:18,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-02-16 10:47:18,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-02-16 10:47:18,954 INFO  L87              Difference]: Start difference. First operand 56 states and 76 transitions. Second operand  has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2023-02-16 10:47:19,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:19,012 INFO  L93              Difference]: Finished difference Result 62 states and 81 transitions.
[2023-02-16 10:47:19,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-02-16 10:47:19,012 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44
[2023-02-16 10:47:19,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:19,015 INFO  L225             Difference]: With dead ends: 62
[2023-02-16 10:47:19,015 INFO  L226             Difference]: Without dead ends: 60
[2023-02-16 10:47:19,015 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-02-16 10:47:19,016 INFO  L413           NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:19,016 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-02-16 10:47:19,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2023-02-16 10:47:19,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2023-02-16 10:47:19,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23)
[2023-02-16 10:47:19,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions.
[2023-02-16 10:47:19,050 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 44
[2023-02-16 10:47:19,050 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:19,050 INFO  L495      AbstractCegarLoop]: Abstraction has 60 states and 79 transitions.
[2023-02-16 10:47:19,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2023-02-16 10:47:19,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions.
[2023-02-16 10:47:19,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2023-02-16 10:47:19,054 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:19,054 INFO  L195           NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:19,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-02-16 10:47:19,055 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:19,055 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:19,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -896370565, now seen corresponding path program 1 times
[2023-02-16 10:47:19,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:19,056 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463633338]
[2023-02-16 10:47:19,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:19,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:19,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,399 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:19,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,402 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2023-02-16 10:47:19,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,409 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2023-02-16 10:47:19,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,414 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2023-02-16 10:47:19,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,416 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2023-02-16 10:47:19,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,423 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-02-16 10:47:19,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,426 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-02-16 10:47:19,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,441 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-02-16 10:47:19,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,445 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-02-16 10:47:19,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,448 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-02-16 10:47:19,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,451 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2023-02-16 10:47:19,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,454 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2023-02-16 10:47:19,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,473 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2023-02-16 10:47:19,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2023-02-16 10:47:19,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:19,477 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463633338]
[2023-02-16 10:47:19,477 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463633338] provided 0 perfect and 1 imperfect interpolant sequences
[2023-02-16 10:47:19,477 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930545822]
[2023-02-16 10:47:19,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:19,478 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-02-16 10:47:19,478 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/thread-witnesses/replication/UAutomizer-linux/z3
[2023-02-16 10:47:19,481 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/thread-witnesses/replication/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-02-16 10:47:19,525 INFO  L327       MonitoredProcess]: [MP /mnt/thread-witnesses/replication/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-02-16 10:47:19,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:19,614 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core
[2023-02-16 10:47:19,627 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-02-16 10:47:20,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2023-02-16 10:47:20,101 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-02-16 10:47:20,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2023-02-16 10:47:20,538 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930545822] provided 0 perfect and 2 imperfect interpolant sequences
[2023-02-16 10:47:20,540 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-02-16 10:47:20,540 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24
[2023-02-16 10:47:20,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299057153]
[2023-02-16 10:47:20,540 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-02-16 10:47:20,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2023-02-16 10:47:20,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:20,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2023-02-16 10:47:20,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552
[2023-02-16 10:47:20,543 INFO  L87              Difference]: Start difference. First operand 60 states and 79 transitions. Second operand  has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38)
[2023-02-16 10:47:21,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:21,105 INFO  L93              Difference]: Finished difference Result 82 states and 108 transitions.
[2023-02-16 10:47:21,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-02-16 10:47:21,106 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 78
[2023-02-16 10:47:21,108 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:21,109 INFO  L225             Difference]: With dead ends: 82
[2023-02-16 10:47:21,109 INFO  L226             Difference]: Without dead ends: 80
[2023-02-16 10:47:21,110 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870
[2023-02-16 10:47:21,110 INFO  L413           NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:21,111 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 129 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2023-02-16 10:47:21,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2023-02-16 10:47:21,141 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68.
[2023-02-16 10:47:21,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23)
[2023-02-16 10:47:21,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions.
[2023-02-16 10:47:21,143 INFO  L78                 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 78
[2023-02-16 10:47:21,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:21,144 INFO  L495      AbstractCegarLoop]: Abstraction has 68 states and 85 transitions.
[2023-02-16 10:47:21,144 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38)
[2023-02-16 10:47:21,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions.
[2023-02-16 10:47:21,149 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-02-16 10:47:21,149 INFO  L187           NwaCegarLoop]: Found error trace
[2023-02-16 10:47:21,149 INFO  L195           NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:21,157 INFO  L540       MonitoredProcess]: [MP /mnt/thread-witnesses/replication/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-02-16 10:47:21,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/thread-witnesses/replication/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2023-02-16 10:47:21,354 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-02-16 10:47:21,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-02-16 10:47:21,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -1405710098, now seen corresponding path program 2 times
[2023-02-16 10:47:21,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-02-16 10:47:21,355 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7817818]
[2023-02-16 10:47:21,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-02-16 10:47:21,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-02-16 10:47:21,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,510 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2023-02-16 10:47:21,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,512 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2023-02-16 10:47:21,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,513 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2023-02-16 10:47:21,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,519 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2023-02-16 10:47:21,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,521 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2023-02-16 10:47:21,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,526 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-02-16 10:47:21,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,528 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2023-02-16 10:47:21,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,545 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2023-02-16 10:47:21,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,547 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2023-02-16 10:47:21,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,550 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2023-02-16 10:47:21,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,554 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2023-02-16 10:47:21,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,556 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2023-02-16 10:47:21,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,557 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2023-02-16 10:47:21,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,560 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2023-02-16 10:47:21,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-02-16 10:47:21,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked.
[2023-02-16 10:47:21,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-02-16 10:47:21,564 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7817818]
[2023-02-16 10:47:21,564 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7817818] provided 1 perfect and 0 imperfect interpolant sequences
[2023-02-16 10:47:21,565 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-02-16 10:47:21,565 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-02-16 10:47:21,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492074230]
[2023-02-16 10:47:21,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-02-16 10:47:21,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-02-16 10:47:21,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-02-16 10:47:21,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-02-16 10:47:21,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-02-16 10:47:21,566 INFO  L87              Difference]: Start difference. First operand 68 states and 85 transitions. Second operand  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2023-02-16 10:47:21,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-02-16 10:47:21,646 INFO  L93              Difference]: Finished difference Result 68 states and 85 transitions.
[2023-02-16 10:47:21,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-02-16 10:47:21,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83
[2023-02-16 10:47:21,649 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-02-16 10:47:21,649 INFO  L225             Difference]: With dead ends: 68
[2023-02-16 10:47:21,649 INFO  L226             Difference]: Without dead ends: 0
[2023-02-16 10:47:21,651 INFO  L412           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-02-16 10:47:21,652 INFO  L413           NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-02-16 10:47:21,653 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-02-16 10:47:21,653 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2023-02-16 10:47:21,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2023-02-16 10:47:21,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-02-16 10:47:21,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2023-02-16 10:47:21,654 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83
[2023-02-16 10:47:21,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-02-16 10:47:21,665 INFO  L495      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-02-16 10:47:21,665 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2023-02-16 10:47:21,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2023-02-16 10:47:21,665 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2023-02-16 10:47:21,668 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-02-16 10:47:21,668 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-02-16 10:47:21,671 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2023-02-16 10:47:22,229 INFO  L899   garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2023-02-16 10:47:22,229 INFO  L899   garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed.
[2023-02-16 10:47:22,229 INFO  L895   garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (not (< |ULTIMATE.start_main_~j~0#1| 3)) (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|))))
[2023-02-16 10:47:22,229 INFO  L895   garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~j~0#1| .cse1) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2)) (and .cse3 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse3 .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|)))))
[2023-02-16 10:47:22,229 INFO  L895   garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~j~0#1| .cse1) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2)) (and .cse3 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse3 .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|)))))
[2023-02-16 10:47:22,231 INFO  L895   garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~j~0#1| .cse1) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2)) (and .cse3 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse3 .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|)))))
[2023-02-16 10:47:22,231 INFO  L899   garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed.
[2023-02-16 10:47:22,231 INFO  L902   garLoopResultBuilder]: At program point main_returnLabel#1(lines 14 33) the Hoare annotation is: true
[2023-02-16 10:47:22,231 INFO  L899   garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed.
[2023-02-16 10:47:22,232 INFO  L899   garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2023-02-16 10:47:22,232 INFO  L895   garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~j~0#1| 4) (not (< |ULTIMATE.start_main_~j~0#1| 3)) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= 2 |ULTIMATE.start_main_~i~0#1|))
[2023-02-16 10:47:22,233 INFO  L895   garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1))))
[2023-02-16 10:47:22,234 INFO  L895   garLoopResultBuilder]: At program point L24(lines 18 25) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (= |ULTIMATE.start_main_~j~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~j~0#1| .cse1) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse3) (and .cse4 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) .cse3) (and .cse4 .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|)))))
[2023-02-16 10:47:22,234 INFO  L895   garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~j~0#1| .cse1) .cse2 (<= |ULTIMATE.start_main_~j~0#1| 2)) (and .cse3 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) .cse2 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1)) (and .cse3 .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|)))))
[2023-02-16 10:47:22,234 INFO  L895   garLoopResultBuilder]: At program point L18-2(lines 18 25) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (* 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (<= .cse1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 3 |ULTIMATE.start_main_~j~0#1|) .cse0 (<= .cse1 (+ 6 |ULTIMATE.start_main_~j~0#1|)) (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) .cse1))))
[2023-02-16 10:47:22,234 INFO  L895   garLoopResultBuilder]: At program point L16-2(lines 16 31) the Hoare annotation is: (or (= |ULTIMATE.start_main_~i~0#1| 0) (and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 1 |ULTIMATE.start_main_~i~0#1|)))
[2023-02-16 10:47:22,234 INFO  L899   garLoopResultBuilder]: For program point L16-3(lines 16 31) no Hoare annotation was computed.
[2023-02-16 10:47:22,235 INFO  L899   garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed.
[2023-02-16 10:47:22,235 INFO  L899   garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed.
[2023-02-16 10:47:22,235 INFO  L899   garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed.
[2023-02-16 10:47:22,235 INFO  L899   garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed.
[2023-02-16 10:47:22,235 INFO  L902   garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true
[2023-02-16 10:47:22,235 INFO  L899   garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed.
[2023-02-16 10:47:22,238 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1]
[2023-02-16 10:47:22,240 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-02-16 10:47:22,269 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 10:47:22 BoogieIcfgContainer
[2023-02-16 10:47:22,269 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-02-16 10:47:22,270 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-02-16 10:47:22,270 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-02-16 10:47:22,270 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-02-16 10:47:22,271 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 10:47:16" (3/4) ...
[2023-02-16 10:47:22,273 INFO  L137         WitnessPrinter]: Generating witness for correct program
[2023-02-16 10:47:22,278 INFO  L361     RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert
[2023-02-16 10:47:22,280 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2023-02-16 10:47:22,281 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2023-02-16 10:47:22,295 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2023-02-16 10:47:22,295 INFO  L961   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2023-02-16 10:47:22,327 INFO  L141         WitnessManager]: Wrote witness to /mnt/thread-witnesses/replication/UAutomizer-linux/witness.graphml
[2023-02-16 10:47:22,336 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-02-16 10:47:22,337 INFO  L158              Benchmark]: Toolchain (without parser) took 6818.96ms. Allocated memory is still 44.0MB. Free memory was 15.5MB in the beginning and 17.1MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 15.6GB.
[2023-02-16 10:47:22,338 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 33.1MB. Free memory was 14.2MB in the beginning and 14.1MB in the end (delta: 27.8kB). Peak memory consumption was 27.8kB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,338 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 308.31ms. Allocated memory is still 44.0MB. Free memory was 15.4MB in the beginning and 16.6MB in the end (delta: -1.3MB). Peak memory consumption was 2.8MB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,338 INFO  L158              Benchmark]: Boogie Procedure Inliner took 62.03ms. Allocated memory is still 44.0MB. Free memory was 16.6MB in the beginning and 15.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,339 INFO  L158              Benchmark]: Boogie Preprocessor took 44.88ms. Allocated memory is still 44.0MB. Free memory was 15.1MB in the beginning and 14.2MB in the end (delta: 967.9kB). Peak memory consumption was 967.9kB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,339 INFO  L158              Benchmark]: RCFGBuilder took 380.21ms. Allocated memory is still 44.0MB. Free memory was 14.0MB in the beginning and 16.0MB in the end (delta: -2.0MB). Peak memory consumption was 2.0MB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,339 INFO  L158              Benchmark]: TraceAbstraction took 5928.49ms. Allocated memory is still 44.0MB. Free memory was 15.5MB in the beginning and 19.7MB in the end (delta: -4.2MB). Peak memory consumption was 6.3MB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,340 INFO  L158              Benchmark]: Witness Printer took 66.29ms. Allocated memory is still 44.0MB. Free memory was 19.7MB in the beginning and 17.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
[2023-02-16 10:47:22,341 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.16ms. Allocated memory is still 33.1MB. Free memory was 14.2MB in the beginning and 14.1MB in the end (delta: 27.8kB). Peak memory consumption was 27.8kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 308.31ms. Allocated memory is still 44.0MB. Free memory was 15.4MB in the beginning and 16.6MB in the end (delta: -1.3MB). Peak memory consumption was 2.8MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 62.03ms. Allocated memory is still 44.0MB. Free memory was 16.6MB in the beginning and 15.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 44.88ms. Allocated memory is still 44.0MB. Free memory was 15.1MB in the beginning and 14.2MB in the end (delta: 967.9kB). Peak memory consumption was 967.9kB. Max. memory is 15.6GB.
 * RCFGBuilder took 380.21ms. Allocated memory is still 44.0MB. Free memory was 14.0MB in the beginning and 16.0MB in the end (delta: -2.0MB). Peak memory consumption was 2.0MB. Max. memory is 15.6GB.
 * TraceAbstraction took 5928.49ms. Allocated memory is still 44.0MB. Free memory was 15.5MB in the beginning and 19.7MB in the end (delta: -4.2MB). Peak memory consumption was 6.3MB. Max. memory is 15.6GB.
 * Witness Printer took 66.29ms. Allocated memory is still 44.0MB. Free memory was 19.7MB in the beginning and 17.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 13]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 915 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 228 mSDtfsCounter, 915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 53 PreInvPairs, 85 NumberOfFragments, 406 HoareAnnotationTreeSize, 53 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 1041 SizeOfPredicates, 2 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1573/1599 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 14]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 16]: Loop Invariant
    Derived loop invariant: i == 0 || (j <= 4 && 1 <= i)
  - InvariantResult [Line: 18]: Loop Invariant
    Derived loop invariant: ((((((2 * i <= j && j <= 2 * i) && 2 <= j) && j <= 2) || (i == 0 && j == 0)) || (((j <= 4 && 2 * i <= 6 + j) && 2 <= j) && 2 + j <= 2 * i)) || ((1 <= i && i <= 3) && j == 0)) || ((j <= 4 && 2 * i <= j) && 2 <= i)
RESULT: Ultimate proved your program to be correct!
[2023-02-16 10:47:22,402 INFO  L552       MonitoredProcess]: [MP /mnt/thread-witnesses/replication/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
