./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:19:18,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:19:18,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:19:18,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:19:18,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:19:18,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:19:18,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:19:18,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:19:18,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:19:18,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:19:18,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:19:18,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:19:18,349 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:19:18,349 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:19:18,352 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:19:18,353 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:19:18,353 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:19:18,353 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:19:18,353 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:19:18,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:19:18,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:19:18,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:19:18,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:19:18,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:19:18,355 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:19:18,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:19:18,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:19:18,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:19:18,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:19:18,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:19:18,357 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:19:18,358 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-clean/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-clean/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 -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2024-10-12 00:19:18,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:19:18,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:19:18,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:19:18,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:19:18,696 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:19:18,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2024-10-12 00:19:20,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:19:20,573 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:19:20,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2024-10-12 00:19:20,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0456ed8ad/b36b7474cbb44d68a55b6e817dcda566/FLAGb252e48ff [2024-10-12 00:19:20,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0456ed8ad/b36b7474cbb44d68a55b6e817dcda566 [2024-10-12 00:19:20,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:19:20,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:19:20,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:20,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:19:20,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:19:20,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:20" (1/1) ... [2024-10-12 00:19:20,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6019592a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:20, skipping insertion in model container [2024-10-12 00:19:20,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:19:20" (1/1) ... [2024-10-12 00:19:20,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:19:20,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:20,963 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:19:21,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:19:21,034 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:19:21,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21 WrapperNode [2024-10-12 00:19:21,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:19:21,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:21,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:19:21,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:19:21,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,074 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-10-12 00:19:21,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:19:21,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:19:21,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:19:21,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:19:21,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,110 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 4, 6]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 2, 3]. [2024-10-12 00:19:21,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:19:21,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:19:21,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:19:21,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:19:21,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (1/1) ... [2024-10-12 00:19:21,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:21,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:19:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:19:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:19:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:19:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:19:21,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:19:21,327 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:19:21,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:19:21,552 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-12 00:19:21,552 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:19:21,574 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:19:21,574 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:19:21,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:21 BoogieIcfgContainer [2024-10-12 00:19:21,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:19:21,576 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:19:21,576 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:19:21,581 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:19:21,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:21,582 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:19:20" (1/3) ... [2024-10-12 00:19:21,583 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee7c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:21, skipping insertion in model container [2024-10-12 00:19:21,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:21,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:19:21" (2/3) ... [2024-10-12 00:19:21,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee7c363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:19:21, skipping insertion in model container [2024-10-12 00:19:21,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:19:21,585 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:19:21" (3/3) ... [2024-10-12 00:19:21,586 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2024-10-12 00:19:21,653 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:19:21,653 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:19:21,653 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:19:21,654 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:19:21,654 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:19:21,654 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:19:21,654 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:19:21,655 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:19:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-12 00:19:21,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:19:21,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:21,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:21,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:21,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:19:21,685 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:19:21,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-12 00:19:21,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:19:21,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:21,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:21,687 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:21,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:19:21,696 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 4#L552-4true [2024-10-12 00:19:21,697 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 11#L553-4true assume !true; 3#L552-3true call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 4#L552-4true [2024-10-12 00:19:21,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:19:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089460516] [2024-10-12 00:19:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:21,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:21,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2024-10-12 00:19:21,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:21,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871284590] [2024-10-12 00:19:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:21,974 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-12 00:19:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871284590] [2024-10-12 00:19:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871284590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:19:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016016258] [2024-10-12 00:19:21,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:21,982 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:19:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:19:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:19:22,016 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12 00:19:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:22,024 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-10-12 00:19:22,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-10-12 00:19:22,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:19:22,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2024-10-12 00:19:22,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:19:22,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:19:22,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-10-12 00:19:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:22,034 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 00:19:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-10-12 00:19:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-12 00:19:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-12 00:19:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-10-12 00:19:22,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 00:19:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:19:22,064 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-12 00:19:22,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:19:22,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-10-12 00:19:22,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-12 00:19:22,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:22,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:22,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:22,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:19:22,066 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 33#L552-4 [2024-10-12 00:19:22,066 INFO L747 eck$LassoCheckResult]: Loop: 33#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 34#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 36#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 32#L552-3 call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 33#L552-4 [2024-10-12 00:19:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:19:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842654203] [2024-10-12 00:19:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:22,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:22,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:22,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2024-10-12 00:19:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:22,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467088229] [2024-10-12 00:19:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:22,260 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-12 00:19:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467088229] [2024-10-12 00:19:22,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467088229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:19:22,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:19:22,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:19:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981705103] [2024-10-12 00:19:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:19:22,262 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:19:22,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:22,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:19:22,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:19:22,263 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-12 00:19:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:22,309 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2024-10-12 00:19:22,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2024-10-12 00:19:22,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:19:22,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2024-10-12 00:19:22,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:19:22,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:19:22,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-10-12 00:19:22,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:22,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-12 00:19:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-10-12 00:19:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-12 00:19:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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-12 00:19:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-10-12 00:19:22,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-12 00:19:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:19:22,315 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-12 00:19:22,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:19:22,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-10-12 00:19:22,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:19:22,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:22,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:22,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:22,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:22,318 INFO L745 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 60#L552-4 [2024-10-12 00:19:22,318 INFO L747 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 66#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 62#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 63#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 59#L552-3 call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 60#L552-4 [2024-10-12 00:19:22,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:19:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014465306] [2024-10-12 00:19:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:22,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:22,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:22,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2024-10-12 00:19:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337293865] [2024-10-12 00:19:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337293865] [2024-10-12 00:19:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337293865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304469821] [2024-10-12 00:19:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:22,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:22,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:22,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 00:19:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:22,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:19:22,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:22,874 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-12 00:19:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2024-10-12 00:19:22,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-10-12 00:19:22,930 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 15 treesize of output 7 [2024-10-12 00:19:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:22,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304469821] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:23,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-10-12 00:19:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341730567] [2024-10-12 00:19:23,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:23,015 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:19:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:19:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:19:23,016 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-12 00:19:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:23,190 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-12 00:19:23,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2024-10-12 00:19:23,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-10-12 00:19:23,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2024-10-12 00:19:23,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:19:23,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:19:23,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2024-10-12 00:19:23,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:23,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-12 00:19:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2024-10-12 00:19:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-10-12 00:19:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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-12 00:19:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-12 00:19:23,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-12 00:19:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:19:23,202 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-12 00:19:23,202 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:19:23,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2024-10-12 00:19:23,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-12 00:19:23,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:23,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:23,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:23,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2024-10-12 00:19:23,203 INFO L745 eck$LassoCheckResult]: Stem: 156#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2024-10-12 00:19:23,203 INFO L747 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 154#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 155#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 167#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 166#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 164#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 163#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 161#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 162#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 151#L552-3 call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 152#L552-4 [2024-10-12 00:19:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:19:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554689159] [2024-10-12 00:19:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:23,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:23,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:23,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2024-10-12 00:19:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690791187] [2024-10-12 00:19:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:23,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690791187] [2024-10-12 00:19:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690791187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894990334] [2024-10-12 00:19:23,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:19:23,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:23,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 00:19:24,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:19:24,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:19:24,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:19:24,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:24,044 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-12 00:19:24,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2024-10-12 00:19:24,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-10-12 00:19:24,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-12 00:19:24,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-10-12 00:19:24,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-12 00:19:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-10-12 00:19:24,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-10-12 00:19:24,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-10-12 00:19:24,129 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 15 treesize of output 7 [2024-10-12 00:19:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:24,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894990334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:24,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 18 [2024-10-12 00:19:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585992695] [2024-10-12 00:19:24,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:24,252 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:19:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 00:19:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2024-10-12 00:19:24,253 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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-12 00:19:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:24,395 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-12 00:19:24,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2024-10-12 00:19:24,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-10-12 00:19:24,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2024-10-12 00:19:24,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-10-12 00:19:24,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-12 00:19:24,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2024-10-12 00:19:24,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:19:24,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-12 00:19:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2024-10-12 00:19:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-12 00:19:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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-12 00:19:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-12 00:19:24,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-12 00:19:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 00:19:24,402 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-12 00:19:24,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:19:24,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2024-10-12 00:19:24,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-10-12 00:19:24,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:24,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:24,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:19:24,404 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2024-10-12 00:19:24,404 INFO L745 eck$LassoCheckResult]: Stem: 339#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 335#L552-4 [2024-10-12 00:19:24,404 INFO L747 eck$LassoCheckResult]: Loop: 335#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 336#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 342#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 341#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 337#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 338#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 367#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 366#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 365#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 364#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 363#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 362#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 361#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 360#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 359#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 358#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 357#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 356#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 355#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 354#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 353#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 352#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 351#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 350#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 349#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 348#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 347#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 346#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 344#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 345#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 343#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 334#L552-3 call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 335#L552-4 [2024-10-12 00:19:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:19:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682266788] [2024-10-12 00:19:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 3 times [2024-10-12 00:19:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563750025] [2024-10-12 00:19:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:24,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 1 times [2024-10-12 00:19:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708358576] [2024-10-12 00:19:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:24,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:37,241 WARN L286 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 274 DAG size of output: 263 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:20:37,826 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:20:37,827 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:20:37,828 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:20:37,828 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:20:37,828 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:20:37,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:37,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:20:37,828 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:20:37,828 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration5_Lasso [2024-10-12 00:20:37,828 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:20:37,828 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:20:37,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:37,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:38,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:20:38,608 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:20:38,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:20:38,618 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-12 00:20:38,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:38,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:38,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:38,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:20:38,674 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-12 00:20:38,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:38,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:20:38,731 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-12 00:20:38,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:20:38,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:20:38,784 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-12 00:20:38,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:20:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:20:38,835 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-12 00:20:38,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:20:38,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-12 00:20:38,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:38,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,918 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:20:38,921 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-12 00:20:38,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:20:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:38,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:38,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:20:38,961 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-12 00:20:38,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:38,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:38,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:38,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:38,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:38,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:38,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:38,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:20:38,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:39,001 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:39,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:20:39,007 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-12 00:20:39,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:39,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:39,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:39,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:39,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:39,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:39,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:39,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:39,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:39,046 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:39,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:20:39,050 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-12 00:20:39,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:39,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:39,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:39,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:39,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:39,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:39,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:20:39,092 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-12 00:20:39,092 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-12 00:20:39,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:39,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:39,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:20:39,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:20:39,124 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:20:39,124 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:20:39,125 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 19 Supporting invariants [] [2024-10-12 00:20:39,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:20:39,216 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-10-12 00:20:39,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-12 00:20:39,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-12 00:20:39,224 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-10-12 00:20:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:39,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:20:39,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:39,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:20:39,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-12 00:20:39,550 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:20:39,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 35 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-12 00:20:39,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 35 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 66 states and 69 transitions. Complement of second has 6 states. [2024-10-12 00:20:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:20:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-12 00:20:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:20:39,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 32 letters. [2024-10-12 00:20:39,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:39,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 34 letters. Loop has 32 letters. [2024-10-12 00:20:39,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:39,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 64 letters. [2024-10-12 00:20:39,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:39,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 69 transitions. [2024-10-12 00:20:39,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:20:39,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 68 transitions. [2024-10-12 00:20:39,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-12 00:20:39,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 00:20:39,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 68 transitions. [2024-10-12 00:20:39,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:20:39,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-12 00:20:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 68 transitions. [2024-10-12 00:20:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2024-10-12 00:20:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-12 00:20:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-10-12 00:20:39,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-12 00:20:39,624 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-10-12 00:20:39,624 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:20:39,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2024-10-12 00:20:39,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:20:39,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:39,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:39,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:20:39,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:20:39,626 INFO L745 eck$LassoCheckResult]: Stem: 652#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 645#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 646#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 649#L553-4 [2024-10-12 00:20:39,626 INFO L747 eck$LassoCheckResult]: Loop: 649#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 654#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 648#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 649#L553-4 [2024-10-12 00:20:39,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2024-10-12 00:20:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:39,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324589948] [2024-10-12 00:20:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash 44848, now seen corresponding path program 1 times [2024-10-12 00:20:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449876493] [2024-10-12 00:20:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:39,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1805952521, now seen corresponding path program 1 times [2024-10-12 00:20:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166850334] [2024-10-12 00:20:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:39,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:40,246 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:20:40,246 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:20:40,246 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:20:40,246 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:20:40,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:20:40,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:20:40,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:20:40,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso [2024-10-12 00:20:40,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:20:40,247 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:20:40,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:20:40,796 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:20:40,796 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:20:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,802 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:40,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:20:40,814 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-12 00:20:40,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:40,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:20:40,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:40,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:40,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:40,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:20:40,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:20:40,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:40,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:20:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:40,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:20:40,848 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-12 00:20:40,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:40,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:40,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:40,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:40,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:40,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:40,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:40,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,884 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:40,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:20:40,886 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-12 00:20:40,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:40,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:40,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:40,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:40,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:40,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:40,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:40,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:40,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:40,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:20:40,921 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-12 00:20:40,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:40,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:40,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:40,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:40,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:40,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:40,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:40,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:20:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,962 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:40,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:20:40,964 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-12 00:20:40,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:40,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:40,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:40,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:40,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:40,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:40,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:40,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:20:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:40,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:40,999 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:41,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:20:41,005 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-12 00:20:41,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:41,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:41,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:41,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:41,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:41,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:41,041 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:41,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:20:41,043 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-12 00:20:41,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:41,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:41,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:41,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:41,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:41,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:41,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:20:41,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:41,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:41,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:41,076 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:41,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:20:41,078 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-12 00:20:41,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:20:41,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:20:41,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:20:41,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:20:41,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:20:41,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:20:41,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:20:41,108 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:20:41,109 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-12 00:20:41,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:20:41,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:20:41,115 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:20:41,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:20:41,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:20:41,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:20:41,141 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:20:41,141 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2 + 23 Supporting invariants [] [2024-10-12 00:20:41,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:20:41,213 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2024-10-12 00:20:41,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:20:41,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:20:41,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2024-10-12 00:20:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:41,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:20:41,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:20:41,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:20:41,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:20:41,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 20 [2024-10-12 00:20:41,310 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-12 00:20:41,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:20:41,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-12 00:20:41,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 103 states and 110 transitions. Complement of second has 9 states. [2024-10-12 00:20:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:20:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-12 00:20:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-10-12 00:20:41,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2024-10-12 00:20:41,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:41,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:20:41,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:41,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-12 00:20:41,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:20:41,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 110 transitions. [2024-10-12 00:20:41,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:20:41,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 74 states and 78 transitions. [2024-10-12 00:20:41,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:20:41,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:20:41,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 78 transitions. [2024-10-12 00:20:41,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:20:41,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-10-12 00:20:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 78 transitions. [2024-10-12 00:20:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-12 00:20:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 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-12 00:20:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-12 00:20:41,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-12 00:20:41,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-12 00:20:41,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:20:41,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 72 transitions. [2024-10-12 00:20:41,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:20:41,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:20:41,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:20:41,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 2, 2, 1, 1, 1, 1] [2024-10-12 00:20:41,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:20:41,364 INFO L745 eck$LassoCheckResult]: Stem: 907#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 908#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#1(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 899#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 900#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 911#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 910#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 905#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 906#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 965#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 964#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 963#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 962#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 961#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 960#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 959#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 958#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 957#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 956#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 955#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 954#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 953#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 952#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 951#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 950#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 949#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 948#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 947#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 946#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 945#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 918#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 919#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 917#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 912#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 897#L552-3 call main_#t~mem10#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#1(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 898#L552-4 call main_#t~mem5#1 := read~int#1(main_~i~0#1.base, main_~i~0#1.offset, 4); 901#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#2(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 904#L553-4 [2024-10-12 00:20:41,365 INFO L747 eck$LassoCheckResult]: Loop: 904#L553-4 call main_#t~mem6#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4); 909#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 903#L553-3 call main_#t~mem9#1 := read~int#2(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#2(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 904#L553-4 [2024-10-12 00:20:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1560827213, now seen corresponding path program 2 times [2024-10-12 00:20:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4898262] [2024-10-12 00:20:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:41,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 44848, now seen corresponding path program 2 times [2024-10-12 00:20:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659144307] [2024-10-12 00:20:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:41,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:20:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:20:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:20:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1287540930, now seen corresponding path program 3 times [2024-10-12 00:20:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:20:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712468939] [2024-10-12 00:20:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:20:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:20:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:20:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:20:41,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace