./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:04:12,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:04:12,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:04:12,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:04:12,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:04:12,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:04:12,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:04:12,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:04:12,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:04:12,804 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:04:12,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:04:12,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:04:12,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:04:12,806 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:04:12,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:04:12,806 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:04:12,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:04:12,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:04:12,807 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:04:12,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:04:12,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:04:12,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:04:12,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:04:12,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:04:12,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:04:12,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:04:12,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:04:12,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:04:12,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:04:12,810 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:04:12,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:04:12,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:04:12,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:04:12,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:04:12,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:04:12,812 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:04:12,812 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(F end) ) 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 -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2024-10-13 17:04:13,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:04:13,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:04:13,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:04:13,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:04:13,047 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:04:13,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-10-13 17:04:14,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:04:14,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:04:14,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-10-13 17:04:14,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5ab3406/f2a6a3f07f9f4923bc1a6b0dab1b6318/FLAGb6af1af1a [2024-10-13 17:04:14,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5ab3406/f2a6a3f07f9f4923bc1a6b0dab1b6318 [2024-10-13 17:04:14,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:04:14,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:04:14,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:04:14,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:04:14,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:04:14,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:14,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677796f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14, skipping insertion in model container [2024-10-13 17:04:14,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:14,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:04:14,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:04:14,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:04:14,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:04:14,982 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:04:14,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14 WrapperNode [2024-10-13 17:04:14,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:04:14,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:04:14,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:04:14,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:04:14,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,042 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-13 17:04:15,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:04:15,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:04:15,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:04:15,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:04:15,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,092 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-13 17:04:15,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:04:15,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:04:15,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:04:15,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:04:15,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (1/1) ... [2024-10-13 17:04:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:15,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:04:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:04:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:04:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:04:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:04:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:04:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:04:15,278 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:04:15,279 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:04:15,383 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 17:04:15,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:04:15,391 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:04:15,391 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 17:04:15,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:04:15 BoogieIcfgContainer [2024-10-13 17:04:15,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:04:15,393 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:04:15,393 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:04:15,396 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:04:15,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:04:15,397 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:04:14" (1/3) ... [2024-10-13 17:04:15,398 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8d9184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:04:15, skipping insertion in model container [2024-10-13 17:04:15,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:04:15,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:04:14" (2/3) ... [2024-10-13 17:04:15,399 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a8d9184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:04:15, skipping insertion in model container [2024-10-13 17:04:15,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:04:15,399 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:04:15" (3/3) ... [2024-10-13 17:04:15,400 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2024-10-13 17:04:15,446 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:04:15,446 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:04:15,447 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:04:15,447 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:04:15,447 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:04:15,447 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:04:15,447 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:04:15,448 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:04:15,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) [2024-10-13 17:04:15,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:04:15,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:15,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:15,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:04:15,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:15,470 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:04:15,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) [2024-10-13 17:04:15,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-13 17:04:15,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:15,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:15,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:04:15,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:15,479 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 14#L367true assume !(main_~length~0#1 < 1); 9#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 6#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2#L371-3true [2024-10-13 17:04:15,479 INFO L747 eck$LassoCheckResult]: Loop: 2#L371-3true assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 12#L371-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2#L371-3true [2024-10-13 17:04:15,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-10-13 17:04:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925993499] [2024-10-13 17:04:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:15,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:15,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:15,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2024-10-13 17:04:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:15,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629273893] [2024-10-13 17:04:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2024-10-13 17:04:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727114786] [2024-10-13 17:04:15,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:15,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:16,004 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:16,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:16,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:16,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:16,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:16,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:16,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:16,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2024-10-13 17:04:16,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:16,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:16,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:16,448 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:16,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:04:16,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:04:16,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:04:16,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:16,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:04:16,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 17:04:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:04:16,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:16,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,619 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:04:16,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:04:16,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:04:16,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-13 17:04:16,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 17:04:16,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:16,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:16,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:16,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 17:04:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,714 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:04:16,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:16,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:16,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:16,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 17:04:16,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:04:16,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:16,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:16,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:16,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:16,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:16,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:16,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:16,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:16,802 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-13 17:04:16,802 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-13 17:04:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:16,810 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:16,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:04:16,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:16,827 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:04:16,827 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:16,828 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 17:04:16,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:16,852 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:04:16,860 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:04:16,861 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:04:16,861 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-13 17:04:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:16,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:04:16,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:16,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:04:16,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:16,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:04:16,934 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-13 17:04:16,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Result 30 states and 42 transitions. Complement of second has 6 states. [2024-10-13 17:04:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-10-13 17:04:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-13 17:04:16,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-13 17:04:16,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:16,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-13 17:04:16,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:16,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-13 17:04:16,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:16,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2024-10-13 17:04:16,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:04:16,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2024-10-13 17:04:16,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:16,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:04:16,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-10-13 17:04:16,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:04:16,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:04:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-10-13 17:04:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 17:04:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-10-13 17:04:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-13 17:04:16,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:04:16,991 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 17:04:16,992 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:04:16,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-13 17:04:16,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:04:16,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:16,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:16,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:16,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:04:16,993 INFO L745 eck$LassoCheckResult]: Stem: 121#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 123#L367 assume !(main_~length~0#1 < 1); 119#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 120#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 113#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L371-4 main_~j~0#1 := 0; 112#L374-3 [2024-10-13 17:04:16,993 INFO L747 eck$LassoCheckResult]: Loop: 112#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 117#L375-3 assume !true; 111#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 112#L374-3 [2024-10-13 17:04:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2024-10-13 17:04:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053604588] [2024-10-13 17:04:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash 65925, now seen corresponding path program 1 times [2024-10-13 17:04:17,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467376615] [2024-10-13 17:04:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467376615] [2024-10-13 17:04:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467376615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:04:17,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:04:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:04:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764146845] [2024-10-13 17:04:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:04:17,027 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:04:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:04:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:04:17,029 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-13 17:04:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:17,032 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2024-10-13 17:04:17,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2024-10-13 17:04:17,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:04:17,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2024-10-13 17:04:17,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:04:17,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:04:17,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-10-13 17:04:17,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:04:17,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-13 17:04:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-10-13 17:04:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 17:04:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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) [2024-10-13 17:04:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-13 17:04:17,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-13 17:04:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:04:17,035 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-13 17:04:17,035 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:04:17,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-10-13 17:04:17,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:04:17,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:17,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:17,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:17,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:04:17,036 INFO L745 eck$LassoCheckResult]: Stem: 152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 142#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 143#L371-4 main_~j~0#1 := 0; 147#L374-3 [2024-10-13 17:04:17,036 INFO L747 eck$LassoCheckResult]: Loop: 147#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 150#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 151#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 146#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 147#L374-3 [2024-10-13 17:04:17,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 2 times [2024-10-13 17:04:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207672877] [2024-10-13 17:04:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2024-10-13 17:04:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025588137] [2024-10-13 17:04:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2024-10-13 17:04:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775327778] [2024-10-13 17:04:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,256 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:17,256 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:17,256 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:17,256 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:17,256 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:17,256 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,256 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:17,256 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:17,256 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2024-10-13 17:04:17,256 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:17,257 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:17,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-13 17:04:17,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:17,559 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:17,560 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:17,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,561 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:04:17,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:17,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:17,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:17,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:04:17,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:17,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:17,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:17,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 17:04:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,624 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:04:17,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:17,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:17,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:17,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:17,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,651 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:04:17,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:17,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:17,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:17,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 17:04:17,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:04:17,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:17,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:17,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:17,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:17,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,702 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:04:17,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:17,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:17,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 17:04:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,733 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:04:17,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:17,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:17,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:17,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 17:04:17,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,764 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 17:04:17,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:17,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:17,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:17,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:17,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:17,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:17,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:17,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:17,806 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-13 17:04:17,806 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-13 17:04:17,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:17,808 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:17,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:04:17,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:17,825 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-13 17:04:17,825 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:17,825 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2024-10-13 17:04:17,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:04:17,849 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:04:17,851 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:04:17,851 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:04:17,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:17,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:04:17,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:17,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:04:17,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:17,937 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-13 17:04:17,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-10-13 17:04:17,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Result 19 states and 25 transitions. Complement of second has 7 states. [2024-10-13 17:04:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-10-13 17:04:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2024-10-13 17:04:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-13 17:04:17,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-13 17:04:17,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2024-10-13 17:04:17,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:17,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2024-10-13 17:04:17,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:17,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2024-10-13 17:04:17,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:17,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:04:17,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-10-13 17:04:17,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:17,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-13 17:04:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-10-13 17:04:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-13 17:04:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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) [2024-10-13 17:04:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-10-13 17:04:17,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-13 17:04:17,977 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-13 17:04:17,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:04:17,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-10-13 17:04:17,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:17,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:17,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:17,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:17,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:17,978 INFO L745 eck$LassoCheckResult]: Stem: 264#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 266#L367 assume !(main_~length~0#1 < 1); 258#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 259#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 252#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 253#L371-4 main_~j~0#1 := 0; 267#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 260#L375-3 [2024-10-13 17:04:17,978 INFO L747 eck$LassoCheckResult]: Loop: 260#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 261#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 260#L375-3 [2024-10-13 17:04:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2024-10-13 17:04:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267558813] [2024-10-13 17:04:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2024-10-13 17:04:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059792171] [2024-10-13 17:04:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:17,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2024-10-13 17:04:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699425946] [2024-10-13 17:04:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699425946] [2024-10-13 17:04:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699425946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:04:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:04:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 17:04:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721137361] [2024-10-13 17:04:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:04:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:18,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 17:04:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 17:04:18,240 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2024-10-13 17:04:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:18,280 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-10-13 17:04:18,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2024-10-13 17:04:18,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:18,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2024-10-13 17:04:18,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:04:18,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:04:18,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2024-10-13 17:04:18,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:18,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-13 17:04:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2024-10-13 17:04:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-10-13 17:04:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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) [2024-10-13 17:04:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-13 17:04:18,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-13 17:04:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:04:18,285 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-13 17:04:18,285 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:04:18,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-10-13 17:04:18,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:18,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:18,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:18,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:18,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:18,287 INFO L745 eck$LassoCheckResult]: Stem: 320#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 322#L367 assume !(main_~length~0#1 < 1); 314#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 315#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 308#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 309#L371-4 main_~j~0#1 := 0; 323#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 318#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 319#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 312#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 313#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 316#L375-3 [2024-10-13 17:04:18,287 INFO L747 eck$LassoCheckResult]: Loop: 316#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 317#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 316#L375-3 [2024-10-13 17:04:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2024-10-13 17:04:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856109468] [2024-10-13 17:04:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856109468] [2024-10-13 17:04:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856109468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276706981] [2024-10-13 17:04:18,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:04:18,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:18,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:18,346 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:18,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 17:04:18,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:04:18,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:18,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:04:18,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:18,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 17:04:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276706981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:04:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 17:04:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-13 17:04:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834015415] [2024-10-13 17:04:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:04:18,473 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:18,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2024-10-13 17:04:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804208578] [2024-10-13 17:04:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-13 17:04:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 17:04:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 17:04:18,511 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2024-10-13 17:04:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:18,546 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-13 17:04:18,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-10-13 17:04:18,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:18,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 19 states and 22 transitions. [2024-10-13 17:04:18,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:18,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:18,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-10-13 17:04:18,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:18,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-13 17:04:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-10-13 17:04:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-13 17:04:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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) [2024-10-13 17:04:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-13 17:04:18,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-13 17:04:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 17:04:18,550 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-13 17:04:18,550 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:04:18,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-13 17:04:18,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:18,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:18,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:18,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:18,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:18,551 INFO L745 eck$LassoCheckResult]: Stem: 415#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 416#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 417#L367 assume !(main_~length~0#1 < 1); 413#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 414#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 403#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 404#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 405#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 406#L371-4 main_~j~0#1 := 0; 419#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 420#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 418#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 407#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 408#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 409#L375-3 [2024-10-13 17:04:18,551 INFO L747 eck$LassoCheckResult]: Loop: 409#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 410#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 409#L375-3 [2024-10-13 17:04:18,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2024-10-13 17:04:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064300238] [2024-10-13 17:04:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2024-10-13 17:04:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72401662] [2024-10-13 17:04:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2024-10-13 17:04:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009060405] [2024-10-13 17:04:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:18,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:18,874 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:18,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:18,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:18,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:18,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:18,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:18,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:18,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:18,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2024-10-13 17:04:18,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:18,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:18,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:18,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:19,203 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:19,203 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:19,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,208 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:04:19,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:19,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:19,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:19,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,248 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 17:04:19,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:19,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:19,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:19,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,285 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:04:19,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:19,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:19,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:19,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,311 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:04:19,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:04:19,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:19,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:19,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:19,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,371 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:04:19,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:19,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:19,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:19,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,395 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:04:19,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,427 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:04:19,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 17:04:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,468 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 17:04:19,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 17:04:19,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,510 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 17:04:19,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-13 17:04:19,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,543 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 17:04:19,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:19,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,573 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 17:04:19,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:19,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:19,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:19,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:19,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:19,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:19,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:19,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:19,622 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 17:04:19,622 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:04:19,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:19,624 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:19,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 17:04:19,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:19,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:04:19,650 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:19,650 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1 Supporting invariants [] [2024-10-13 17:04:19,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-13 17:04:19,684 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:04:19,685 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:04:19,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:04:19,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:04:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:19,767 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:04:19,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:19,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Result 18 states and 21 transitions. Complement of second has 4 states. [2024-10-13 17:04:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-13 17:04:19,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-13 17:04:19,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:19,784 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:19,863 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:04:19,863 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:19,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Result 18 states and 21 transitions. Complement of second has 4 states. [2024-10-13 17:04:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-10-13 17:04:19,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-13 17:04:19,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:19,878 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:19,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:19,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:19,952 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:04:19,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:20,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:20,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Result 32 states and 38 transitions. Complement of second has 10 states. [2024-10-13 17:04:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:04:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-10-13 17:04:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-10-13 17:04:20,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-13 17:04:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:20,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 16 letters. Loop has 2 letters. [2024-10-13 17:04:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:20,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 17:04:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:20,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2024-10-13 17:04:20,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:20,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2024-10-13 17:04:20,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:04:20,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:04:20,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-10-13 17:04:20,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:20,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-13 17:04:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-10-13 17:04:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-13 17:04:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 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) [2024-10-13 17:04:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-13 17:04:20,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-13 17:04:20,037 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-13 17:04:20,037 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:04:20,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-10-13 17:04:20,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:20,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:20,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:20,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:20,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:20,041 INFO L745 eck$LassoCheckResult]: Stem: 720#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 722#L367 assume !(main_~length~0#1 < 1); 718#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 719#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 710#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 711#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 712#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 713#L371-4 main_~j~0#1 := 0; 725#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 726#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 729#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 728#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 727#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 724#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 730#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 708#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 709#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 714#L375-3 [2024-10-13 17:04:20,041 INFO L747 eck$LassoCheckResult]: Loop: 714#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 715#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 714#L375-3 [2024-10-13 17:04:20,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1706672357, now seen corresponding path program 2 times [2024-10-13 17:04:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:20,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448116350] [2024-10-13 17:04:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448116350] [2024-10-13 17:04:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448116350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463332856] [2024-10-13 17:04:20,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:04:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:20,115 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:20,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-13 17:04:20,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:04:20,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:20,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:04:20,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:20,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463332856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:20,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-13 17:04:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736921476] [2024-10-13 17:04:20,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:20,262 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 4 times [2024-10-13 17:04:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:20,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783715532] [2024-10-13 17:04:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:20,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:20,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:20,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 17:04:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-13 17:04:20,297 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 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) [2024-10-13 17:04:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:20,354 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-13 17:04:20,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2024-10-13 17:04:20,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:20,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 26 states and 30 transitions. [2024-10-13 17:04:20,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:20,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:20,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-10-13 17:04:20,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:20,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-13 17:04:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-10-13 17:04:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-13 17:04:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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) [2024-10-13 17:04:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 17:04:20,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 17:04:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 17:04:20,360 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 17:04:20,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:04:20,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-10-13 17:04:20,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:20,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:20,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:20,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:20,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:20,362 INFO L745 eck$LassoCheckResult]: Stem: 899#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 900#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 901#L367 assume !(main_~length~0#1 < 1); 892#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 893#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 886#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 887#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 888#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 889#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 898#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 904#L371-4 main_~j~0#1 := 0; 905#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 906#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 910#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 890#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 903#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 909#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 908#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 907#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 894#L375-3 [2024-10-13 17:04:20,363 INFO L747 eck$LassoCheckResult]: Loop: 894#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 895#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 894#L375-3 [2024-10-13 17:04:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1762185767, now seen corresponding path program 3 times [2024-10-13 17:04:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252644850] [2024-10-13 17:04:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252644850] [2024-10-13 17:04:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252644850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836083962] [2024-10-13 17:04:20,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:04:20,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:20,672 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:20,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-13 17:04:20,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 17:04:20,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:20,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 17:04:20,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:04:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 17:04:20,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:04:20,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:04:20,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:20,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-10-13 17:04:20,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:20,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 17:04:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:20,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:21,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-13 17:04:21,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 17:04:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:21,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836083962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:21,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:21,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2024-10-13 17:04:21,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649519160] [2024-10-13 17:04:21,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:21,043 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:21,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 5 times [2024-10-13 17:04:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:21,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405327189] [2024-10-13 17:04:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 17:04:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-10-13 17:04:21,075 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 8 Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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) [2024-10-13 17:04:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:21,178 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-13 17:04:21,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-10-13 17:04:21,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:21,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 31 transitions. [2024-10-13 17:04:21,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:21,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:21,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-10-13 17:04:21,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:21,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-13 17:04:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-10-13 17:04:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-13 17:04:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 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) [2024-10-13 17:04:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-13 17:04:21,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-13 17:04:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:04:21,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-13 17:04:21,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:04:21,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-10-13 17:04:21,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:21,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:21,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:21,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:21,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:21,183 INFO L745 eck$LassoCheckResult]: Stem: 1092#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1093#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1094#L367 assume !(main_~length~0#1 < 1); 1086#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1087#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1080#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1081#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1082#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1083#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1105#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1097#L371-4 main_~j~0#1 := 0; 1098#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1099#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1104#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1084#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1085#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1100#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1095#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1096#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1103#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1102#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1101#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1088#L375-3 [2024-10-13 17:04:21,183 INFO L747 eck$LassoCheckResult]: Loop: 1088#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1089#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1088#L375-3 [2024-10-13 17:04:21,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1241819266, now seen corresponding path program 2 times [2024-10-13 17:04:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:21,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407679468] [2024-10-13 17:04:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:21,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 6 times [2024-10-13 17:04:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886124867] [2024-10-13 17:04:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 612594979, now seen corresponding path program 3 times [2024-10-13 17:04:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566186013] [2024-10-13 17:04:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:21,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:21,637 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:21,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:21,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:21,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:21,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:21,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:21,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:21,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:21,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2024-10-13 17:04:21,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:21,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:21,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:21,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:22,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:22,025 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:22,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,029 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 17:04:22,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,056 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 17:04:22,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,087 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 17:04:22,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,122 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 17:04:22,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,155 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 17:04:22,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-13 17:04:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,183 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 17:04:22,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,210 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 17:04:22,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:22,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 17:04:22,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,240 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 17:04:22,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:22,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:22,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:22,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:22,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:22,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:22,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:22,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:22,271 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-13 17:04:22,271 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-13 17:04:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:22,272 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:22,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 17:04:22,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:22,284 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:04:22,285 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:22,285 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1 Supporting invariants [] [2024-10-13 17:04:22,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:22,334 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:04:22,338 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:04:22,339 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:04:22,339 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:04:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:22,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:04:22,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:22,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:22,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:22,711 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:04:22,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:22,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) Result 26 states and 30 transitions. Complement of second has 5 states. [2024-10-13 17:04:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:22,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-13 17:04:22,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:22,751 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:22,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:22,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:04:22,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:22,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:22,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:22,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:04:22,909 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:22,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) Result 26 states and 30 transitions. Complement of second has 5 states. [2024-10-13 17:04:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:22,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-13 17:04:22,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:22,946 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:22,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:04:22,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:23,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:23,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:23,154 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:04:23,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:23,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) Result 40 states and 47 transitions. Complement of second has 13 states. [2024-10-13 17:04:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:04:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-10-13 17:04:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-10-13 17:04:23,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-13 17:04:23,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:23,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 24 letters. Loop has 2 letters. [2024-10-13 17:04:23,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:23,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 22 letters. Loop has 4 letters. [2024-10-13 17:04:23,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:23,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-10-13 17:04:23,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:23,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 40 transitions. [2024-10-13 17:04:23,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:04:23,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:04:23,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2024-10-13 17:04:23,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:23,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-13 17:04:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2024-10-13 17:04:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-13 17:04:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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) [2024-10-13 17:04:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-13 17:04:23,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 17:04:23,257 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 17:04:23,257 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:04:23,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2024-10-13 17:04:23,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:23,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:23,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:23,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:23,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:23,258 INFO L745 eck$LassoCheckResult]: Stem: 1543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1545#L367 assume !(main_~length~0#1 < 1); 1540#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1541#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1530#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1531#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1532#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1533#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1542#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1547#L371-4 main_~j~0#1 := 0; 1548#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1549#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1555#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1556#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1560#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1538#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1539#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1546#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1559#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1534#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1535#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1550#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1554#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1553#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1551#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1536#L375-3 [2024-10-13 17:04:23,258 INFO L747 eck$LassoCheckResult]: Loop: 1536#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1537#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1536#L375-3 [2024-10-13 17:04:23,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 293254931, now seen corresponding path program 4 times [2024-10-13 17:04:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:23,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735132631] [2024-10-13 17:04:23,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:23,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 17:04:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:04:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735132631] [2024-10-13 17:04:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735132631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41804344] [2024-10-13 17:04:23,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:04:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:23,415 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:23,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-10-13 17:04:23,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:04:23,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:23,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:04:23,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:04:23,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:04:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41804344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:23,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-13 17:04:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500683364] [2024-10-13 17:04:23,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:23,723 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 7 times [2024-10-13 17:04:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454235387] [2024-10-13 17:04:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:23,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:23,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 17:04:23,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-13 17:04:23,775 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 10 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 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) [2024-10-13 17:04:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:23,917 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-13 17:04:23,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2024-10-13 17:04:23,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:23,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 34 states and 39 transitions. [2024-10-13 17:04:23,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:23,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:23,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2024-10-13 17:04:23,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:23,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-13 17:04:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2024-10-13 17:04:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-13 17:04:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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) [2024-10-13 17:04:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-13 17:04:23,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-13 17:04:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:04:23,921 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-13 17:04:23,921 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:04:23,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2024-10-13 17:04:23,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:23,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:23,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:23,922 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:23,922 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:23,922 INFO L745 eck$LassoCheckResult]: Stem: 1793#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1794#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1795#L367 assume !(main_~length~0#1 < 1); 1786#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1787#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1780#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1781#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1782#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1783#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1792#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1806#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1805#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1797#L371-4 main_~j~0#1 := 0; 1798#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1799#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1811#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1810#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1800#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1790#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1791#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1796#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1812#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1784#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1785#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1808#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1804#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1803#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1801#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1788#L375-3 [2024-10-13 17:04:23,922 INFO L747 eck$LassoCheckResult]: Loop: 1788#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1789#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1788#L375-3 [2024-10-13 17:04:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 136841169, now seen corresponding path program 5 times [2024-10-13 17:04:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579591974] [2024-10-13 17:04:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579591974] [2024-10-13 17:04:24,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579591974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:24,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486500485] [2024-10-13 17:04:24,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 17:04:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:24,321 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:24,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-10-13 17:04:24,376 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-13 17:04:24,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:24,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 17:04:24,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:24,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:04:24,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 17:04:24,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:24,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-10-13 17:04:24,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:24,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 33 [2024-10-13 17:04:24,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:24,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-10-13 17:04:24,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:24,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 15 [2024-10-13 17:04:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:24,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:04:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486500485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:28,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:28,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 34 [2024-10-13 17:04:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400155187] [2024-10-13 17:04:28,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:28,716 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 8 times [2024-10-13 17:04:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273078152] [2024-10-13 17:04:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:28,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:28,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 17:04:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=984, Unknown=1, NotChecked=0, Total=1122 [2024-10-13 17:04:28,757 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 10 Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 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) [2024-10-13 17:04:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:29,530 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-10-13 17:04:29,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-10-13 17:04:29,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:29,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 58 states and 66 transitions. [2024-10-13 17:04:29,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:29,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:29,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-10-13 17:04:29,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:29,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-13 17:04:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-10-13 17:04:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2024-10-13 17:04:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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) [2024-10-13 17:04:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-13 17:04:29,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-13 17:04:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 17:04:29,535 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-13 17:04:29,535 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:04:29,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2024-10-13 17:04:29,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:29,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:29,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:29,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:29,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:29,536 INFO L745 eck$LassoCheckResult]: Stem: 2129#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2131#L367 assume !(main_~length~0#1 < 1); 2126#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2127#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2118#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2119#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2144#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2128#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2120#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2121#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2139#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 2133#L371-4 main_~j~0#1 := 0; 2134#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2135#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2150#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2116#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2117#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2124#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2125#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2132#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2151#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2149#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2148#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2147#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2146#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2145#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2142#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2143#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2140#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2138#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2136#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2122#L375-3 [2024-10-13 17:04:29,536 INFO L747 eck$LassoCheckResult]: Loop: 2122#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2123#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2122#L375-3 [2024-10-13 17:04:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2103364059, now seen corresponding path program 6 times [2024-10-13 17:04:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266847938] [2024-10-13 17:04:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 9 times [2024-10-13 17:04:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048843435] [2024-10-13 17:04:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1596734400, now seen corresponding path program 7 times [2024-10-13 17:04:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432385839] [2024-10-13 17:04:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:29,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:30,428 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:30,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:30,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:30,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:30,429 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:30,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:30,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:30,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2024-10-13 17:04:30,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:30,429 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:30,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:30,845 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:30,845 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,847 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 17:04:30,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:30,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:30,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,877 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 17:04:30,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:30,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:30,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:30,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:30,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,902 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 17:04:30,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:30,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:30,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:30,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,927 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 17:04:30,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:30,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:30,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:30,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 17:04:30,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,951 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 17:04:30,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:30,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:30,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:30,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,975 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 17:04:30,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:30,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:30,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:30,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:30,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:30,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:30,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:30,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:30,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:30,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:30,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:30,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:30,998 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:30,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-13 17:04:31,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:31,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:31,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:31,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:31,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:31,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:31,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:31,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:31,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:31,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:31,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:31,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:31,023 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:31,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-13 17:04:31,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:31,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:31,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:31,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:31,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:31,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:31,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:31,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:31,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:31,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-13 17:04:31,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:31,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:31,047 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:31,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-13 17:04:31,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:31,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:31,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:31,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:31,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:31,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:31,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:31,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:31,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:31,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:31,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:31,073 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:31,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 17:04:31,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:31,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:31,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:31,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:31,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:31,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:31,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:31,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:31,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:31,104 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:31,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 17:04:31,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:31,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:31,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:31,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:31,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:31,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:31,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:31,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:31,135 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 17:04:31,135 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:04:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:31,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:31,137 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:31,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 17:04:31,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:31,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:04:31,149 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:31,149 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1 Supporting invariants [] [2024-10-13 17:04:31,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:31,170 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-10-13 17:04:31,172 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:04:31,172 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:04:31,172 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:04:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:31,370 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-10-13 17:04:31,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) Result 36 states and 41 transitions. Complement of second has 5 states. [2024-10-13 17:04:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:31,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 32 letters. Loop has 2 letters. [2024-10-13 17:04:31,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:31,407 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:31,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:31,598 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:04:31,598 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,622 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) Result 36 states and 41 transitions. Complement of second has 5 states. [2024-10-13 17:04:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:31,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 32 letters. Loop has 2 letters. [2024-10-13 17:04:31,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:31,623 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:31,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:31,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:31,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:31,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-13 17:04:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:31,857 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-10-13 17:04:31,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) Result 50 states and 58 transitions. Complement of second has 15 states. [2024-10-13 17:04:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:04:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 17:04:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2024-10-13 17:04:31,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 32 letters. Loop has 2 letters. [2024-10-13 17:04:31,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:31,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 34 letters. Loop has 2 letters. [2024-10-13 17:04:31,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:31,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 32 letters. Loop has 4 letters. [2024-10-13 17:04:31,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:31,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-10-13 17:04:31,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:31,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 51 transitions. [2024-10-13 17:04:31,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:04:31,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:04:31,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-10-13 17:04:31,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:31,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-13 17:04:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-10-13 17:04:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-10-13 17:04:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 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) [2024-10-13 17:04:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-13 17:04:31,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-13 17:04:31,985 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-13 17:04:31,985 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 17:04:31,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-10-13 17:04:31,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:31,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:31,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:31,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:31,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:31,986 INFO L745 eck$LassoCheckResult]: Stem: 2702#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2703#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2704#L367 assume !(main_~length~0#1 < 1); 2699#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2700#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2689#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2690#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2691#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2692#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2701#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2711#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2710#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 2706#L371-4 main_~j~0#1 := 0; 2707#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2708#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2729#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2727#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2709#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2697#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2698#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2705#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2728#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2693#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2694#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2726#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2725#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2724#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2723#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2722#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2721#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2720#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2717#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2718#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2715#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2714#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2712#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2695#L375-3 [2024-10-13 17:04:31,986 INFO L747 eck$LassoCheckResult]: Loop: 2695#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2696#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2695#L375-3 [2024-10-13 17:04:31,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1158434064, now seen corresponding path program 8 times [2024-10-13 17:04:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266269808] [2024-10-13 17:04:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 31 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 17:04:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266269808] [2024-10-13 17:04:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266269808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983828111] [2024-10-13 17:04:32,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:04:32,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:32,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:32,100 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:32,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-10-13 17:04:32,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:04:32,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:32,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 17:04:32,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 17:04:32,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 17:04:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983828111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:32,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:32,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-10-13 17:04:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387283730] [2024-10-13 17:04:32,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:32,348 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 10 times [2024-10-13 17:04:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:32,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342463281] [2024-10-13 17:04:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:32,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:32,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 17:04:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-10-13 17:04:32,379 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 12 Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 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) [2024-10-13 17:04:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:32,448 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-10-13 17:04:32,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 78 transitions. [2024-10-13 17:04:32,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:32,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 44 states and 50 transitions. [2024-10-13 17:04:32,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:32,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:32,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2024-10-13 17:04:32,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:32,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-13 17:04:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2024-10-13 17:04:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-13 17:04:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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) [2024-10-13 17:04:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-13 17:04:32,455 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-13 17:04:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 17:04:32,455 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-13 17:04:32,456 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 17:04:32,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2024-10-13 17:04:32,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:32,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:32,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:32,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:32,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:32,457 INFO L745 eck$LassoCheckResult]: Stem: 3043#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3045#L367 assume !(main_~length~0#1 < 1); 3041#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3042#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3033#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3034#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3035#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3036#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3058#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3057#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3056#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3054#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3053#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3047#L371-4 main_~j~0#1 := 0; 3048#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3049#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3073#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3031#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3032#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3039#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3040#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3046#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3072#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3071#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3070#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3069#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3068#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3067#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3066#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3065#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3064#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3063#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3061#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3059#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3055#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3052#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3050#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3037#L375-3 [2024-10-13 17:04:32,457 INFO L747 eck$LassoCheckResult]: Loop: 3037#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3038#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3037#L375-3 [2024-10-13 17:04:32,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -151409106, now seen corresponding path program 9 times [2024-10-13 17:04:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349010863] [2024-10-13 17:04:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 17:04:33,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349010863] [2024-10-13 17:04:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349010863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126759185] [2024-10-13 17:04:33,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:04:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:33,237 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:33,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-10-13 17:04:33,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 17:04:33,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:33,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 17:04:33,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:33,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:04:33,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 17:04:33,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-10-13 17:04:33,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2024-10-13 17:04:33,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 45 [2024-10-13 17:04:33,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-10-13 17:04:33,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-10-13 17:04:33,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:33,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-10-13 17:04:34,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:34,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 18 [2024-10-13 17:04:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:34,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 17:04:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126759185] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:34,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 45 [2024-10-13 17:04:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344968024] [2024-10-13 17:04:34,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:34,995 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 11 times [2024-10-13 17:04:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531955365] [2024-10-13 17:04:34,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:34,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:35,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 17:04:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 17:04:35,030 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 12 Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 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) [2024-10-13 17:04:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:36,516 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-10-13 17:04:36,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 101 transitions. [2024-10-13 17:04:36,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:36,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 84 states and 95 transitions. [2024-10-13 17:04:36,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:36,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:36,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-10-13 17:04:36,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:36,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-13 17:04:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-10-13 17:04:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 46. [2024-10-13 17:04:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-10-13 17:04:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-13 17:04:36,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-13 17:04:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-13 17:04:36,520 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-13 17:04:36,520 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 17:04:36,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 52 transitions. [2024-10-13 17:04:36,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:36,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:36,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:36,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:36,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:36,521 INFO L745 eck$LassoCheckResult]: Stem: 3503#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3505#L367 assume !(main_~length~0#1 < 1); 3500#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3501#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3490#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3491#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3492#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3493#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3502#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3521#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3520#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3515#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3514#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3507#L371-4 main_~j~0#1 := 0; 3508#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3509#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3534#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3533#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3510#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3498#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3499#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3506#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3535#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3494#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3495#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3532#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3531#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3530#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3529#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3528#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3527#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3526#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3525#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3524#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3523#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3522#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3518#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3519#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3516#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3513#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3511#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3496#L375-3 [2024-10-13 17:04:36,521 INFO L747 eck$LassoCheckResult]: Loop: 3496#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3497#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3496#L375-3 [2024-10-13 17:04:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1005848136, now seen corresponding path program 10 times [2024-10-13 17:04:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025630479] [2024-10-13 17:04:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 17:04:37,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025630479] [2024-10-13 17:04:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025630479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200916314] [2024-10-13 17:04:37,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:04:37,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:37,306 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:37,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-10-13 17:04:37,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:04:37,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:37,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 17:04:37,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:37,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:04:37,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 17:04:37,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:37,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-10-13 17:04:37,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:37,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 48 [2024-10-13 17:04:37,667 INFO L349 Elim1Store]: treesize reduction 102, result has 25.5 percent of original size [2024-10-13 17:04:37,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 51 [2024-10-13 17:04:37,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-10-13 17:04:37,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-10-13 17:04:38,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:38,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-10-13 17:04:38,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:38,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 51 [2024-10-13 17:04:38,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:38,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 51 [2024-10-13 17:04:38,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:38,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 18 [2024-10-13 17:04:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:38,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:40,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 Int) (v_ArrVal_482 Int) (v_ArrVal_480 Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int)) (let ((.cse0 (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (< |v_ULTIMATE.start_main_~i~0#1_117| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (< v_ArrVal_480 (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1)) (< v_ArrVal_482 (+ v_ArrVal_480 1)) (< 2 (select (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1) v_ArrVal_480) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 4) v_ArrVal_482) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12)))))) is different from false [2024-10-13 17:04:41,956 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 Int) (v_ArrVal_482 Int) (v_ArrVal_480 Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int)) (let ((.cse0 (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (< v_ArrVal_480 (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1)) 1)) (< 2 (select (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 4) v_ArrVal_480) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 8) v_ArrVal_482) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12))) (< |v_ULTIMATE.start_main_~i~0#1_117| (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (< v_ArrVal_482 (+ v_ArrVal_480 1))))) is different from false [2024-10-13 17:04:43,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 Int) (v_ArrVal_482 Int) (v_ArrVal_480 Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int#0| |c_ULTIMATE.start_main_~arr~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (or (< 2 (select (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1) v_ArrVal_479) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 4) v_ArrVal_480) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 8) v_ArrVal_482) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_484) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 12))) (< v_ArrVal_479 (+ (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 (- 4))) 1)) (< |v_ULTIMATE.start_main_~i~0#1_117| (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (< v_ArrVal_480 (+ v_ArrVal_479 1)) (< v_ArrVal_482 (+ v_ArrVal_480 1))))) is different from false [2024-10-13 17:04:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 78 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2024-10-13 17:04:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200916314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:43,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 17] total 46 [2024-10-13 17:04:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621078467] [2024-10-13 17:04:43,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:43,352 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:43,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 12 times [2024-10-13 17:04:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:43,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813984395] [2024-10-13 17:04:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:43,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:43,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-13 17:04:43,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1638, Unknown=4, NotChecked=252, Total=2070 [2024-10-13 17:04:43,385 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. cyclomatic complexity: 12 Second operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 46 states have internal predecessors, (95), 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) [2024-10-13 17:04:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:44,358 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-10-13 17:04:44,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 96 transitions. [2024-10-13 17:04:44,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:44,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 94 transitions. [2024-10-13 17:04:44,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:44,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:44,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 94 transitions. [2024-10-13 17:04:44,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:44,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-13 17:04:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 94 transitions. [2024-10-13 17:04:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2024-10-13 17:04:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.125) internal successors, (54), 47 states have internal predecessors, (54), 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) [2024-10-13 17:04:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-13 17:04:44,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-13 17:04:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-13 17:04:44,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-13 17:04:44,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-13 17:04:44,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2024-10-13 17:04:44,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:44,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:44,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:44,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:44,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:44,363 INFO L745 eck$LassoCheckResult]: Stem: 3964#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3966#L367 assume !(main_~length~0#1 < 1); 3962#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3963#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3952#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3953#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3954#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3955#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3980#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3979#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3978#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3976#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3975#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3968#L371-4 main_~j~0#1 := 0; 3969#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3970#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3999#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3998#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3971#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3960#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3961#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3967#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3994#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3956#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3957#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3997#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3996#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3995#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3993#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3992#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3991#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3990#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3989#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3988#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3987#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3986#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3985#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3984#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3982#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3983#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3977#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3974#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3972#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3958#L375-3 [2024-10-13 17:04:44,363 INFO L747 eck$LassoCheckResult]: Loop: 3958#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3959#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3958#L375-3 [2024-10-13 17:04:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -250828899, now seen corresponding path program 11 times [2024-10-13 17:04:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166932159] [2024-10-13 17:04:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:44,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 13 times [2024-10-13 17:04:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:44,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659712561] [2024-10-13 17:04:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash -528402046, now seen corresponding path program 12 times [2024-10-13 17:04:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37231006] [2024-10-13 17:04:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:44,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:50,042 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 247 DAG size of output: 185 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:04:50,205 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:04:50,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:04:50,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:04:50,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:04:50,206 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:04:50,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,206 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:04:50,206 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:04:50,206 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration16_Lasso [2024-10-13 17:04:50,206 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:04:50,206 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:04:50,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:04:50,637 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:04:50,637 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:04:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,639 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-13 17:04:50,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:50,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:50,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:50,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,666 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-13 17:04:50,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:50,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:50,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:50,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-13 17:04:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,690 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-13 17:04:50,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:04:50,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:04:50,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:04:50,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,714 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-13 17:04:50,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-13 17:04:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,740 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-13 17:04:50,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,770 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-13 17:04:50,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,799 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-13 17:04:50,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-13 17:04:50,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,825 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-13 17:04:50,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,852 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-13 17:04:50,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-13 17:04:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,878 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-13 17:04:50,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,904 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-13 17:04:50,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,932 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-13 17:04:50,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:04:50,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:50,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,959 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-13 17:04:50,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:04:50,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:04:50,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:04:50,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:04:50,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:04:50,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:04:50,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:04:50,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:04:50,988 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:04:50,988 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:04:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:04:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:50,991 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:04:50,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-13 17:04:50,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:04:51,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:04:51,003 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:04:51,003 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1 Supporting invariants [] [2024-10-13 17:04:51,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-13 17:04:51,051 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2024-10-13 17:04:51,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:04:51,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:04:51,052 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:04:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:51,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:04:51,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:51,370 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) Result 48 states and 54 transitions. Complement of second has 5 states. [2024-10-13 17:04:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:51,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:04:51,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:51,371 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-13 17:04:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:51,670 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:04:51,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:51,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) Result 48 states and 54 transitions. Complement of second has 5 states. [2024-10-13 17:04:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:04:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 17:04:51,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:04:51,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:51,714 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:04:51,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:51,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:04:51,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:51,965 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:04:51,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:52,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) Result 62 states and 71 transitions. Complement of second has 17 states. [2024-10-13 17:04:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:04:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-10-13 17:04:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2024-10-13 17:04:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:04:52,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 46 letters. Loop has 2 letters. [2024-10-13 17:04:52,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 44 letters. Loop has 4 letters. [2024-10-13 17:04:52,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:04:52,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2024-10-13 17:04:52,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:52,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 64 transitions. [2024-10-13 17:04:52,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:04:52,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:04:52,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 64 transitions. [2024-10-13 17:04:52,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:52,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-10-13 17:04:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 64 transitions. [2024-10-13 17:04:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-10-13 17:04:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 52 states have internal predecessors, (60), 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) [2024-10-13 17:04:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-10-13 17:04:52,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-13 17:04:52,124 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-13 17:04:52,124 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-13 17:04:52,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2024-10-13 17:04:52,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:52,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:52,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:52,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:52,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:52,126 INFO L745 eck$LassoCheckResult]: Stem: 4729#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 4731#L367 assume !(main_~length~0#1 < 1); 4722#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 4723#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 4716#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4717#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4718#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4719#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4728#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4739#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4738#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4737#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4736#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 4733#L371-4 main_~j~0#1 := 0; 4734#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4735#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4768#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4720#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4721#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4726#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4727#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4732#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4767#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4766#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4765#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4764#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4763#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4762#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4761#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4760#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4759#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4758#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4757#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4756#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4755#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4754#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4753#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4752#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4751#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4750#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4749#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4748#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4745#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4746#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4743#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4742#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4740#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4724#L375-3 [2024-10-13 17:04:52,126 INFO L747 eck$LassoCheckResult]: Loop: 4724#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4725#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4724#L375-3 [2024-10-13 17:04:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -988225614, now seen corresponding path program 13 times [2024-10-13 17:04:52,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:52,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299065376] [2024-10-13 17:04:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 86 proven. 45 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 17:04:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299065376] [2024-10-13 17:04:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299065376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496876555] [2024-10-13 17:04:52,289 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 17:04:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:52,300 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:52,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-10-13 17:04:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:52,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 17:04:52,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 17:04:52,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 17:04:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496876555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:52,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-10-13 17:04:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414781830] [2024-10-13 17:04:52,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:52,644 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:52,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 14 times [2024-10-13 17:04:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410835578] [2024-10-13 17:04:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:52,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:52,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:52,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 17:04:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-10-13 17:04:52,674 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. cyclomatic complexity: 14 Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 states have internal predecessors, (72), 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) [2024-10-13 17:04:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:04:52,770 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-13 17:04:52,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 102 transitions. [2024-10-13 17:04:52,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:52,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 56 states and 63 transitions. [2024-10-13 17:04:52,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:04:52,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:04:52,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 63 transitions. [2024-10-13 17:04:52,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:04:52,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-10-13 17:04:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 63 transitions. [2024-10-13 17:04:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-13 17:04:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 54 states have internal predecessors, (62), 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) [2024-10-13 17:04:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-10-13 17:04:52,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-10-13 17:04:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 17:04:52,774 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-10-13 17:04:52,774 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-13 17:04:52,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 62 transitions. [2024-10-13 17:04:52,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:04:52,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:04:52,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:04:52,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:04:52,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:04:52,776 INFO L745 eck$LassoCheckResult]: Stem: 5179#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 5181#L367 assume !(main_~length~0#1 < 1); 5177#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5178#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 5169#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5170#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5171#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5172#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5196#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5195#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5194#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5193#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5192#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5190#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5189#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 5183#L371-4 main_~j~0#1 := 0; 5184#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5185#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5219#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5167#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5168#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5175#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5176#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5182#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5221#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5220#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5218#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5217#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5216#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5215#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5214#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5213#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5212#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5211#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5210#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5209#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5208#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5207#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5206#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5205#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5204#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5203#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5202#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5201#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5199#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5197#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5191#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5188#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5186#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5173#L375-3 [2024-10-13 17:04:52,776 INFO L747 eck$LassoCheckResult]: Loop: 5173#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5174#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5173#L375-3 [2024-10-13 17:04:52,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1555688944, now seen corresponding path program 14 times [2024-10-13 17:04:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315224728] [2024-10-13 17:04:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:04:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 17:04:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:04:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315224728] [2024-10-13 17:04:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315224728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:04:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097198012] [2024-10-13 17:04:53,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:04:53,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:04:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:04:53,696 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:04:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-10-13 17:04:53,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:04:53,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:04:53,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 17:04:53,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:04:53,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:04:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 17:04:53,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:53,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-10-13 17:04:53,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:53,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2024-10-13 17:04:54,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 54 [2024-10-13 17:04:54,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-10-13 17:04:54,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-10-13 17:04:54,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-10-13 17:04:54,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-10-13 17:04:54,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-10-13 17:04:54,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-10-13 17:04:54,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:54,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-10-13 17:04:55,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:04:55,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 21 [2024-10-13 17:04:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:04:55,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:04:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 131 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 17:04:59,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097198012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:04:59,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:04:59,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 18] total 57 [2024-10-13 17:04:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644380548] [2024-10-13 17:04:59,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:04:59,631 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:04:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:04:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 15 times [2024-10-13 17:04:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:04:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008060207] [2024-10-13 17:04:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:04:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:04:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:59,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:04:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:04:59,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:04:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:04:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-13 17:04:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2920, Unknown=1, NotChecked=0, Total=3192 [2024-10-13 17:04:59,682 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. cyclomatic complexity: 14 Second operand has 57 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 57 states have internal predecessors, (121), 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) [2024-10-13 17:05:02,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 17:05:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:05:04,639 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-10-13 17:05:04,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 134 transitions. [2024-10-13 17:05:04,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:05:04,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 114 states and 128 transitions. [2024-10-13 17:05:04,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:05:04,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:05:04,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 128 transitions. [2024-10-13 17:05:04,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:05:04,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 128 transitions. [2024-10-13 17:05:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 128 transitions. [2024-10-13 17:05:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2024-10-13 17:05:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 57 states have internal predecessors, (65), 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) [2024-10-13 17:05:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-10-13 17:05:04,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-10-13 17:05:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-13 17:05:04,646 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-10-13 17:05:04,646 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-13 17:05:04,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 65 transitions. [2024-10-13 17:05:04,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:05:04,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:05:04,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:05:04,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:05:04,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:05:04,647 INFO L745 eck$LassoCheckResult]: Stem: 5783#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 5785#L367 assume !(main_~length~0#1 < 1); 5780#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5781#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 5772#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5773#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5774#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5775#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5782#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5803#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5802#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5801#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5800#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5795#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5794#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 5787#L371-4 main_~j~0#1 := 0; 5788#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5789#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5826#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5825#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5790#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5778#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5779#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5786#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5827#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5770#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5771#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5824#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5823#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5822#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5821#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5820#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5819#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5818#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5817#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5816#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5815#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5814#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5813#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5812#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5811#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5810#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5809#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5808#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5807#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5806#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5805#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5804#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5798#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5799#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5796#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5793#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5791#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5776#L375-3 [2024-10-13 17:05:04,647 INFO L747 eck$LassoCheckResult]: Loop: 5776#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5777#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5776#L375-3 [2024-10-13 17:05:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:05:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -868054918, now seen corresponding path program 15 times [2024-10-13 17:05:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:05:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991862063] [2024-10-13 17:05:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:05:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:05:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:05:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 9 proven. 179 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 17:05:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:05:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991862063] [2024-10-13 17:05:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991862063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:05:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681364424] [2024-10-13 17:05:05,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:05:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:05:05,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:05:05,650 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:05:05,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-10-13 17:05:05,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-13 17:05:05,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:05:05,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-13 17:05:05,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:05:05,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:05:05,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 17:05:05,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:05:05,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 17:05:06,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2024-10-13 17:05:06,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:05:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 58 [2024-10-13 17:05:06,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:05:06,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 61 [2024-10-13 17:05:06,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:05:06,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 61 [2024-10-13 17:05:06,804 INFO L349 Elim1Store]: treesize reduction 78, result has 57.1 percent of original size [2024-10-13 17:05:06,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 77 treesize of output 134 [2024-10-13 17:05:07,131 INFO L349 Elim1Store]: treesize reduction 78, result has 57.1 percent of original size [2024-10-13 17:05:07,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 187 treesize of output 198 [2024-10-13 17:05:08,240 INFO L349 Elim1Store]: treesize reduction 176, result has 36.0 percent of original size [2024-10-13 17:05:08,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 332 treesize of output 264 [2024-10-13 17:05:10,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:10,688 INFO L349 Elim1Store]: treesize reduction 340, result has 37.8 percent of original size [2024-10-13 17:05:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 30 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 856 treesize of output 628 [2024-10-13 17:05:17,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:18,161 INFO L349 Elim1Store]: treesize reduction 360, result has 34.2 percent of original size [2024-10-13 17:05:18,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 30 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 894 treesize of output 622 [2024-10-13 17:05:25,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:25,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:26,064 INFO L349 Elim1Store]: treesize reduction 460, result has 23.6 percent of original size [2024-10-13 17:05:26,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 75 case distinctions, treesize of input 770 treesize of output 537 [2024-10-13 17:05:29,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:29,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:30,060 INFO L349 Elim1Store]: treesize reduction 460, result has 23.6 percent of original size [2024-10-13 17:05:30,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 75 case distinctions, treesize of input 770 treesize of output 531 [2024-10-13 17:05:32,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:32,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:05:33,175 INFO L349 Elim1Store]: treesize reduction 76, result has 76.6 percent of original size [2024-10-13 17:05:33,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 33 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 759 treesize of output 610 [2024-10-13 17:05:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:05:44,045 INFO L311 TraceCheckSpWp]: Computing backward predicates...