./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:19:10,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:19:10,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:19:10,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:19:10,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:19:10,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:19:10,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:19:10,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:19:10,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:19:10,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:19:10,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:19:10,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:19:10,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:19:10,466 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:19:10,466 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:19:10,466 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:19:10,466 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:19:10,467 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:19:10,467 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:19:10,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:19:10,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:19:10,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:19:10,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:19:10,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:19:10,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:19:10,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:19:10,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:19:10,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:19:10,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:19:10,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:19:10,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:19:10,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:19:10,471 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:19:10,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:19:10,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:19:10,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:19:10,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:19:10,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:19:10,473 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:19:10,473 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2024-11-20 22:19:10,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:19:10,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:19:10,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:19:10,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:19:10,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:19:10,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2024-11-20 22:19:11,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:19:12,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:19:12,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2024-11-20 22:19:12,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a119d1e0/00613f000c1f4837a55264570fe8bb76/FLAG6a0973390 [2024-11-20 22:19:12,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a119d1e0/00613f000c1f4837a55264570fe8bb76 [2024-11-20 22:19:12,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:19:12,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:19:12,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:19:12,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:19:12,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:19:12,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101acf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12, skipping insertion in model container [2024-11-20 22:19:12,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:19:12,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:19:12,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:19:12,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:19:12,732 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:19:12,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12 WrapperNode [2024-11-20 22:19:12,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:19:12,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:19:12,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:19:12,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:19:12,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,760 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-20 22:19:12,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:19:12,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:19:12,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:19:12,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:19:12,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,783 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-20 22:19:12,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:19:12,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:19:12,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:19:12,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:19:12,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (1/1) ... [2024-11-20 22:19:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:12,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:12,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:19:12,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:19:12,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:19:12,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:19:12,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:19:12,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:19:12,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:19:13,226 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-20 22:19:13,226 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:19:13,240 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:19:13,240 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 22:19:13,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:19:13 BoogieIcfgContainer [2024-11-20 22:19:13,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:19:13,242 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:19:13,242 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:19:13,248 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:19:13,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:19:13,252 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:19:12" (1/3) ... [2024-11-20 22:19:13,253 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1372f330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:19:13, skipping insertion in model container [2024-11-20 22:19:13,253 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:19:13,254 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:19:12" (2/3) ... [2024-11-20 22:19:13,254 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1372f330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:19:13, skipping insertion in model container [2024-11-20 22:19:13,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:19:13,254 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:19:13" (3/3) ... [2024-11-20 22:19:13,256 INFO L332 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2024-11-20 22:19:13,301 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:19:13,301 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:19:13,301 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:19:13,302 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:19:13,303 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:19:13,303 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:19:13,303 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:19:13,303 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:19:13,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:13,321 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-20 22:19:13,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:13,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:13,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:19:13,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:19:13,326 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:19:13,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:13,329 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-20 22:19:13,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:13,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:13,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:19:13,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:19:13,339 INFO L745 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 18#L34-3true [2024-11-20 22:19:13,339 INFO L747 eck$LassoCheckResult]: Loop: 18#L34-3true assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 12#L34-2true main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18#L34-3true [2024-11-20 22:19:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-20 22:19:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:13,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705931667] [2024-11-20 22:19:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:13,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-20 22:19:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:13,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736762452] [2024-11-20 22:19:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:13,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:13,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-20 22:19:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813140980] [2024-11-20 22:19:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:13,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:13,783 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:19:13,784 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:19:13,784 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:19:13,784 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:19:13,784 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:19:13,784 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:13,784 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:19:13,785 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:19:13,785 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2024-11-20 22:19:13,785 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:19:13,785 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:19:13,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:13,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:14,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:19:14,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:19:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:19:14,147 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-11-20 22:19:14,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:14,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:14,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:14,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:14,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:19:14,178 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-11-20 22:19:14,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:14,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:14,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:14,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-20 22:19:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:19:14,209 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-11-20 22:19:14,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:19:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:19:14,243 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-11-20 22:19:14,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-20 22:19:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:19:14,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:19:14,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:14,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:14,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:14,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:19:14,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:19:14,311 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-11-20 22:19:14,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:14,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:14,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:14,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:19:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:19:14,349 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-11-20 22:19:14,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:19:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:19:14,387 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-11-20 22:19:14,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-20 22:19:14,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:19:14,415 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-11-20 22:19:14,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:14,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:19:14,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,440 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:19:14,443 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-11-20 22:19:14,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:14,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:14,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:14,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:14,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:14,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:14,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:19:14,505 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-20 22:19:14,506 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:19:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:14,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:19:14,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:19:14,549 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:19:14,549 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:19:14,550 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-20 22:19:14,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-20 22:19:14,571 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:19:14,579 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:19:14,579 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:19:14,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:14,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:19:14,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:14,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:19:14,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:14,687 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:19:14,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-11-20 22:19:14,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 64 states and 93 transitions. Complement of second has 6 states. [2024-11-20 22:19:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:19:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-11-20 22:19:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-11-20 22:19:14,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-20 22:19:14,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:14,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-20 22:19:14,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:14,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-20 22:19:14,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:14,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 93 transitions. [2024-11-20 22:19:14,752 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:14,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 25 states and 36 transitions. [2024-11-20 22:19:14,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-20 22:19:14,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:19:14,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 36 transitions. [2024-11-20 22:19:14,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:14,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-20 22:19:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 36 transitions. [2024-11-20 22:19:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-20 22:19:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-20 22:19:14,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-20 22:19:14,774 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-20 22:19:14,775 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:19:14,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-11-20 22:19:14,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:14,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:14,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:14,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:19:14,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:14,776 INFO L745 eck$LassoCheckResult]: Stem: 171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 162#L34-3 assume !(main_~i~1#1 < 5); 153#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 154#L20-3 [2024-11-20 22:19:14,776 INFO L747 eck$LassoCheckResult]: Loop: 154#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 168#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 169#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 170#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 154#L20-3 [2024-11-20 22:19:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-20 22:19:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865266646] [2024-11-20 22:19:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865266646] [2024-11-20 22:19:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865266646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:19:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:19:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:19:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090231914] [2024-11-20 22:19:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:19:14,822 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:14,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2024-11-20 22:19:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536242967] [2024-11-20 22:19:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:14,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:14,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:19:14,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:19:14,905 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-11-20 22:19:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:14,919 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-20 22:19:14,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2024-11-20 22:19:14,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:14,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2024-11-20 22:19:14,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-20 22:19:14,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:19:14,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2024-11-20 22:19:14,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:14,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-20 22:19:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2024-11-20 22:19:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-20 22:19:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 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-11-20 22:19:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-11-20 22:19:14,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-20 22:19:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:19:14,926 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-20 22:19:14,926 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:19:14,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-11-20 22:19:14,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:14,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:14,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:14,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:19:14,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:14,927 INFO L745 eck$LassoCheckResult]: Stem: 228#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 219#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 221#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 222#L34-3 assume !(main_~i~1#1 < 5); 210#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 211#L20-3 [2024-11-20 22:19:14,927 INFO L747 eck$LassoCheckResult]: Loop: 211#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 226#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 227#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 225#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 211#L20-3 [2024-11-20 22:19:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-20 22:19:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835518804] [2024-11-20 22:19:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835518804] [2024-11-20 22:19:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835518804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197680363] [2024-11-20 22:19:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:14,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:14,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:14,994 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:15,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 22:19:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:15,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:19:15,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:15,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:15,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197680363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:15,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:15,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 22:19:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271098152] [2024-11-20 22:19:15,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:15,070 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:15,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2024-11-20 22:19:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855018553] [2024-11-20 22:19:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:19:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:19:15,137 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-11-20 22:19:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:15,164 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-20 22:19:15,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2024-11-20 22:19:15,164 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:15,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2024-11-20 22:19:15,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-20 22:19:15,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:19:15,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2024-11-20 22:19:15,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:15,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-20 22:19:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2024-11-20 22:19:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-20 22:19:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 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-11-20 22:19:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-20 22:19:15,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-20 22:19:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:19:15,172 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-20 22:19:15,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:19:15,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2024-11-20 22:19:15,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:15,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:15,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:15,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-20 22:19:15,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:15,175 INFO L745 eck$LassoCheckResult]: Stem: 324#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 315#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 327#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 328#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 317#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 318#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 332#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 331#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 330#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 329#L34-3 assume !(main_~i~1#1 < 5); 306#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 307#L20-3 [2024-11-20 22:19:15,175 INFO L747 eck$LassoCheckResult]: Loop: 307#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 321#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 322#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 323#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 307#L20-3 [2024-11-20 22:19:15,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-20 22:19:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791181985] [2024-11-20 22:19:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791181985] [2024-11-20 22:19:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791181985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867312418] [2024-11-20 22:19:15,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:19:15,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:15,295 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:15,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 22:19:15,342 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:19:15,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:15,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:19:15,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:15,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867312418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:15,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-20 22:19:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150158913] [2024-11-20 22:19:15,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:15,399 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2024-11-20 22:19:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474797786] [2024-11-20 22:19:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 22:19:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-20 22:19:15,443 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-11-20 22:19:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:15,462 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-20 22:19:15,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-20 22:19:15,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:15,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-11-20 22:19:15,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-20 22:19:15,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-20 22:19:15,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-11-20 22:19:15,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:15,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-20 22:19:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-11-20 22:19:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 22:19:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 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-11-20 22:19:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-20 22:19:15,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-20 22:19:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:19:15,466 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-20 22:19:15,467 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:19:15,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2024-11-20 22:19:15,467 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-20 22:19:15,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:15,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:15,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2024-11-20 22:19:15,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:15,468 INFO L745 eck$LassoCheckResult]: Stem: 465#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 456#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 468#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 469#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 458#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 459#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 475#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 474#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 473#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 472#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 471#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 470#L34-3 assume !(main_~i~1#1 < 5); 447#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 448#L20-3 [2024-11-20 22:19:15,468 INFO L747 eck$LassoCheckResult]: Loop: 448#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 462#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 463#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 464#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 448#L20-3 [2024-11-20 22:19:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2024-11-20 22:19:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915829513] [2024-11-20 22:19:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:15,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2024-11-20 22:19:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809649308] [2024-11-20 22:19:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:15,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2024-11-20 22:19:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555405113] [2024-11-20 22:19:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:15,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:15,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:16,275 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:19:16,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:19:16,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:19:16,276 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:19:16,276 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:19:16,276 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,276 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:19:16,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:19:16,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration5_Lasso [2024-11-20 22:19:16,276 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:19:16,276 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:19:16,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:16,709 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:19:16,709 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:19:16,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,711 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:19:16,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:19:16,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:16,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:16,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:16,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-20 22:19:16,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,739 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:19:16,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:19:16,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:16,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:16,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:16,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-20 22:19:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,762 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:19:16,763 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-11-20 22:19:16,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-20 22:19:16,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,785 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:19:16,787 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-11-20 22:19:16,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:19:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,819 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:19:16,822 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-11-20 22:19:16,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:16,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,847 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:19:16,852 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-11-20 22:19:16,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:16,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:16,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:16,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-20 22:19:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,871 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:19:16,873 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-11-20 22:19:16,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:16,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,907 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:19:16,909 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-11-20 22:19:16,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:16,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-20 22:19:16,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:19:16,937 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-11-20 22:19:16,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:16,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:16,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:16,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:16,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:16,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:16,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:19:16,968 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-20 22:19:16,969 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-20 22:19:16,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:16,971 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:16,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:19:16,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:19:16,984 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:19:16,984 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:19:16,984 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 9 Supporting invariants [] [2024-11-20 22:19:16,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:17,003 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-20 22:19:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:19:17,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:19:17,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:17,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:19:17,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:17,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 47 transitions. Complement of second has 5 states. [2024-11-20 22:19:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:19:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-20 22:19:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-20 22:19:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 4 letters. [2024-11-20 22:19:17,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:17,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 8 letters. [2024-11-20 22:19:17,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:17,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2024-11-20 22:19:17,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 42 transitions. [2024-11-20 22:19:17,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-20 22:19:17,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-20 22:19:17,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2024-11-20 22:19:17,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:17,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-20 22:19:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2024-11-20 22:19:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 22:19:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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-11-20 22:19:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-20 22:19:17,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-20 22:19:17,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-20 22:19:17,088 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:19:17,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-11-20 22:19:17,089 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:17,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:17,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:17,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:17,091 INFO L745 eck$LassoCheckResult]: Stem: 642#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 632#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 645#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 646#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 634#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 635#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 652#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 651#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 650#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 649#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 648#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 647#L34-3 assume !(main_~i~1#1 < 5); 623#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 624#L20-3 assume !(max_~i~0#1 < 5); 633#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 630#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 629#L20-8 [2024-11-20 22:19:17,091 INFO L747 eck$LassoCheckResult]: Loop: 629#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 619#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 620#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 636#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 629#L20-8 [2024-11-20 22:19:17,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2024-11-20 22:19:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694069483] [2024-11-20 22:19:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:19:17,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:17,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694069483] [2024-11-20 22:19:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694069483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:19:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:19:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:19:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726421474] [2024-11-20 22:19:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:19:17,150 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2024-11-20 22:19:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303786921] [2024-11-20 22:19:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:19:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:19:17,199 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-20 22:19:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:17,220 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-20 22:19:17,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2024-11-20 22:19:17,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2024-11-20 22:19:17,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-20 22:19:17,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:19:17,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2024-11-20 22:19:17,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:17,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-20 22:19:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2024-11-20 22:19:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-20 22:19:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 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-11-20 22:19:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-20 22:19:17,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-20 22:19:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:19:17,224 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-20 22:19:17,224 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:19:17,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2024-11-20 22:19:17,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:17,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:17,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:17,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:17,230 INFO L745 eck$LassoCheckResult]: Stem: 727#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 716#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 717#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 719#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 720#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 731#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 738#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 737#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 736#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 735#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 734#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 733#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 732#L34-3 assume !(main_~i~1#1 < 5); 708#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 709#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 723#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 725#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 726#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 724#L20-3 assume !(max_~i~0#1 < 5); 718#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 715#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 714#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 704#L21-3 [2024-11-20 22:19:17,230 INFO L747 eck$LassoCheckResult]: Loop: 704#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 705#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 721#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 730#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 704#L21-3 [2024-11-20 22:19:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2024-11-20 22:19:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964246573] [2024-11-20 22:19:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:19:17,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964246573] [2024-11-20 22:19:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964246573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:17,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213439800] [2024-11-20 22:19:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:17,298 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:17,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-20 22:19:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:19:17,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:19:17,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:19:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213439800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:17,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 22:19:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805348147] [2024-11-20 22:19:17,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:17,374 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:17,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2024-11-20 22:19:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35135046] [2024-11-20 22:19:17,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:19:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:19:17,432 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-11-20 22:19:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:17,484 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-11-20 22:19:17,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 88 transitions. [2024-11-20 22:19:17,485 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 88 transitions. [2024-11-20 22:19:17,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-20 22:19:17,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-20 22:19:17,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2024-11-20 22:19:17,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:17,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-11-20 22:19:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2024-11-20 22:19:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2024-11-20 22:19:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 58 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-11-20 22:19:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-11-20 22:19:17,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-20 22:19:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:19:17,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-20 22:19:17,490 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:19:17,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2024-11-20 22:19:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:17,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:17,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:17,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:17,492 INFO L745 eck$LassoCheckResult]: Stem: 971#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 959#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 960#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 962#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 963#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 975#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 992#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 990#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 988#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 986#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 984#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 982#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 981#L34-3 assume !(main_~i~1#1 < 5); 951#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 952#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 968#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 970#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 966#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 967#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 969#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 995#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 994#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 993#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 991#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 989#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 987#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 985#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 979#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 983#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 980#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 978#L20-3 assume !(max_~i~0#1 < 5); 961#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 958#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 957#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 947#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 948#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 964#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 974#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1005#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1004#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1003#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1002#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1001#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1000#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 999#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 998#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 977#L21-3 [2024-11-20 22:19:17,492 INFO L747 eck$LassoCheckResult]: Loop: 977#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 997#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 996#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 976#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 977#L21-3 [2024-11-20 22:19:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 1 times [2024-11-20 22:19:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543537384] [2024-11-20 22:19:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 22:19:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543537384] [2024-11-20 22:19:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543537384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277230308] [2024-11-20 22:19:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:17,573 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:17,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-20 22:19:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:17,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:19:17,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 22:19:17,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:19:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 22:19:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277230308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:19:17,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:19:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-20 22:19:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931348951] [2024-11-20 22:19:17,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:19:17,692 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:19:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2024-11-20 22:19:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980380219] [2024-11-20 22:19:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 22:19:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-20 22:19:17,800 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-11-20 22:19:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:17,872 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-20 22:19:17,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2024-11-20 22:19:17,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2024-11-20 22:19:17,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-20 22:19:17,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-20 22:19:17,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2024-11-20 22:19:17,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:17,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-11-20 22:19:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2024-11-20 22:19:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2024-11-20 22:19:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 66 states have internal predecessors, (82), 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-11-20 22:19:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-11-20 22:19:17,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-11-20 22:19:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:19:17,879 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-11-20 22:19:17,879 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:19:17,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2024-11-20 22:19:17,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-20 22:19:17,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:17,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:17,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:17,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:19:17,881 INFO L745 eck$LassoCheckResult]: Stem: 1398#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1386#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1388#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1389#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1402#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1419#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1417#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1415#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1413#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1411#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1409#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1408#L34-3 assume !(main_~i~1#1 < 5); 1375#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1376#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1393#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1396#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1397#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1394#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1395#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1428#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1426#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1424#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1423#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1422#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1421#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1420#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1418#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1416#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1414#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1412#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1406#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1410#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1407#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1405#L20-3 assume !(max_~i~0#1 < 5); 1387#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1383#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1384#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1371#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1372#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1401#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1381#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1382#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1390#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1391#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1437#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1436#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1435#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1434#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1433#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1432#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1431#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1430#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1429#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1404#L21-3 [2024-11-20 22:19:17,881 INFO L747 eck$LassoCheckResult]: Loop: 1404#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1427#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1425#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1403#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1404#L21-3 [2024-11-20 22:19:17,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 2 times [2024-11-20 22:19:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305828770] [2024-11-20 22:19:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:17,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2024-11-20 22:19:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352919418] [2024-11-20 22:19:17,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:17,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2024-11-20 22:19:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325853854] [2024-11-20 22:19:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-20 22:19:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:18,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325853854] [2024-11-20 22:19:18,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325853854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:18,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929096430] [2024-11-20 22:19:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:18,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:18,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:18,052 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:18,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-20 22:19:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:18,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:19:18,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-20 22:19:18,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 22:19:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929096430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:19:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 22:19:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-20 22:19:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521661277] [2024-11-20 22:19:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:19:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:19:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 22:19:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-20 22:19:18,200 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 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-11-20 22:19:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:18,276 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-11-20 22:19:18,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2024-11-20 22:19:18,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:19:18,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2024-11-20 22:19:18,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-20 22:19:18,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-20 22:19:18,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2024-11-20 22:19:18,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:18,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-20 22:19:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2024-11-20 22:19:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-20 22:19:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 61 states have internal predecessors, (73), 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-11-20 22:19:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-20 22:19:18,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-20 22:19:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:19:18,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-20 22:19:18,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:19:18,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2024-11-20 22:19:18,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:19:18,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:18,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:18,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:18,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:19:18,283 INFO L745 eck$LassoCheckResult]: Stem: 1727#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1718#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1729#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1730#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1720#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1721#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1768#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1767#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1766#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1765#L34-3 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1; 1764#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1763#L34-3 assume !(main_~i~1#1 < 5); 1711#L34-4 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1712#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1723#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1724#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1725#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1726#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1762#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1760#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1758#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1756#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1754#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1752#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1750#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1748#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1746#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1744#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1742#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1740#L20-3 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1738#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1736#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1734#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1732#L20-3 assume !(max_~i~0#1 < 5); 1719#L20-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1716#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1715#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1707#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1708#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1722#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1728#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1761#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1759#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1757#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1755#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1753#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1751#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1749#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1747#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1745#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1743#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1741#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1739#L20-8 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1737#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1735#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1; 1733#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1731#L20-8 assume !(max_~i~0#1 < 5); 1709#L20-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1710#max_returnLabel#2 main_#t~ret10#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 1714#L43-3 [2024-11-20 22:19:18,283 INFO L747 eck$LassoCheckResult]: Loop: 1714#L43-3 assume !!(main_~i~2#1 < 4);call main_#t~mem12#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem12#1; 1713#L43-2 main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1714#L43-3 [2024-11-20 22:19:18,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2024-11-20 22:19:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902815629] [2024-11-20 22:19:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:18,329 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2024-11-20 22:19:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:18,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370407368] [2024-11-20 22:19:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2024-11-20 22:19:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534867937] [2024-11-20 22:19:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:19:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:19:18,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:19:22,046 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:19:22,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:19:22,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:19:22,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:19:22,047 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:19:22,047 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,047 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:19:22,047 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:19:22,047 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration10_Lasso [2024-11-20 22:19:22,047 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:19:22,047 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:19:22,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:19:22,659 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:19:22,660 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:19:22,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,666 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:19:22,668 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-11-20 22:19:22,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,688 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:19:22,690 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-11-20 22:19:22,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,709 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:19:22,711 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-11-20 22:19:22,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-20 22:19:22,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,742 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:19:22,743 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-11-20 22:19:22,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,768 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:19:22,770 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-11-20 22:19:22,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-20 22:19:22,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,788 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:19:22,790 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-11-20 22:19:22,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-20 22:19:22,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,808 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:19:22,810 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-11-20 22:19:22,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,828 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-20 22:19:22,831 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-11-20 22:19:22,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-20 22:19:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,851 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-20 22:19:22,852 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-11-20 22:19:22,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-20 22:19:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,871 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:19:22,873 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-11-20 22:19:22,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:19:22,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:19:22,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:19:22,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,892 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:19:22,893 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-11-20 22:19:22,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:22,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:22,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,915 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:19:22,916 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-11-20 22:19:22,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:22,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:22,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,937 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:19:22,939 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-11-20 22:19:22,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:22,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:22,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-20 22:19:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,960 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:19:22,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-11-20 22:19:22,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:22,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:22,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:22,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:22,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:22,983 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:19:22,987 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-11-20 22:19:22,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:22,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:22,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:22,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:22,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:22,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:23,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-20 22:19:23,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,008 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:19:23,010 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-11-20 22:19:23,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:23,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:23,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:23,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:23,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:23,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:23,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,031 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:19:23,033 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-11-20 22:19:23,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:23,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:23,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:23,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:23,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:23,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:23,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,058 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-20 22:19:23,060 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-11-20 22:19:23,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:23,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:23,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:23,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:23,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:23,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:23,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,081 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-20 22:19:23,083 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-11-20 22:19:23,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:23,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:23,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:23,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:23,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:23,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:19:23,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,105 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-20 22:19:23,108 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-11-20 22:19:23,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:19:23,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:19:23,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:19:23,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:19:23,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:19:23,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:19:23,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:19:23,141 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-20 22:19:23,141 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:19:23,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:19:23,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:23,144 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:19:23,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:19:23,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:19:23,163 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:19:23,163 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:19:23,164 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3, ULTIMATE.start_main_~i~2#1) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3 - 16*ULTIMATE.start_main_~i~2#1 Supporting invariants [] [2024-11-20 22:19:23,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,190 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:19:23,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:19:23,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:19:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:23,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:19:23,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:23,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:19:23,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:19:23,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:19:23,386 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:23,405 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 76 transitions. Complement of second has 4 states. [2024-11-20 22:19:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:19:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:19:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-11-20 22:19:23,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2024-11-20 22:19:23,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:23,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2024-11-20 22:19:23,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:23,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2024-11-20 22:19:23,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:19:23,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2024-11-20 22:19:23,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:19:23,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2024-11-20 22:19:23,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:19:23,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:19:23,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:19:23,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:19:23,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:19:23,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:19:23,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:19:23,411 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:19:23,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:19:23,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:19:23,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:19:23,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:19:23 BoogieIcfgContainer [2024-11-20 22:19:23,420 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:19:23,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:19:23,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:19:23,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:19:23,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:19:13" (3/4) ... [2024-11-20 22:19:23,423 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:19:23,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:19:23,425 INFO L158 Benchmark]: Toolchain (without parser) took 10900.83ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 111.4MB in the beginning and 112.8MB in the end (delta: -1.4MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2024-11-20 22:19:23,426 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:19:23,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.65ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 98.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 22:19:23,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.28ms. Allocated memory is still 180.4MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:19:23,428 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 180.4MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:19:23,428 INFO L158 Benchmark]: RCFGBuilder took 440.28ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 144.3MB in the end (delta: -50.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 22:19:23,428 INFO L158 Benchmark]: BuchiAutomizer took 10178.73ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 144.3MB in the beginning and 112.8MB in the end (delta: 31.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2024-11-20 22:19:23,428 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 299.9MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:19:23,429 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.65ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 98.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.28ms. Allocated memory is still 180.4MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 180.4MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.28ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 144.3MB in the end (delta: -50.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 10178.73ms. Allocated memory was 180.4MB in the beginning and 299.9MB in the end (delta: 119.5MB). Free memory was 144.3MB in the beginning and 112.8MB in the end (delta: 31.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 299.9MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 9.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 631 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 229 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital275 mio100 ax100 hnf100 lsp92 ukn53 mio100 lsp45 div100 bol100 ite100 ukn100 eq154 hnf92 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-20 22:19:23,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:23,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-20 22:19:23,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:24,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:24,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-20 22:19:24,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-20 22:19:24,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE