./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:23:07,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:23:07,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:23:07,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:23:07,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:23:07,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:23:07,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:23:07,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:23:07,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:23:07,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:23:07,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:23:07,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:23:07,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:23:07,286 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:23:07,286 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:23:07,286 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:23:07,287 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:23:07,291 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:23:07,291 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:23:07,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:23:07,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:23:07,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:23:07,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:23:07,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:23:07,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:23:07,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:23:07,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:23:07,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:23:07,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:23:07,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:23:07,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:23:07,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:23:07,300 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:23:07,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:23:07,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:23:07,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:23:07,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:23:07,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:23:07,303 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:23:07,303 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2024-10-12 00:23:07,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:23:07,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:23:07,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:23:07,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:23:07,631 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:23:07,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2024-10-12 00:23:09,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:23:09,411 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:23:09,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2024-10-12 00:23:09,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/597a1cb06/9b143b0610ff4f2697a4303a820a6025/FLAG158d28d01 [2024-10-12 00:23:09,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/597a1cb06/9b143b0610ff4f2697a4303a820a6025 [2024-10-12 00:23:09,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:23:09,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:23:09,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:23:09,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:23:09,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:23:09,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a06e1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09, skipping insertion in model container [2024-10-12 00:23:09,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:23:09,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:23:09,717 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:23:09,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:23:09,766 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:23:09,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09 WrapperNode [2024-10-12 00:23:09,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:23:09,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:23:09,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:23:09,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:23:09,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,811 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-10-12 00:23:09,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:23:09,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:23:09,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:23:09,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:23:09,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,850 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-10-12 00:23:09,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:23:09,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:23:09,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:23:09,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:23:09,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (1/1) ... [2024-10-12 00:23:09,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:09,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:09,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:09,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:23:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:23:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:23:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:23:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:23:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:23:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:23:10,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:23:10,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:23:10,343 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-12 00:23:10,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:23:10,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:23:10,356 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 00:23:10,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:23:10 BoogieIcfgContainer [2024-10-12 00:23:10,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:23:10,358 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:23:10,358 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:23:10,361 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:23:10,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:10,362 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:23:09" (1/3) ... [2024-10-12 00:23:10,363 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30136ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:23:10, skipping insertion in model container [2024-10-12 00:23:10,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:10,363 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:09" (2/3) ... [2024-10-12 00:23:10,363 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30136ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:23:10, skipping insertion in model container [2024-10-12 00:23:10,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:10,364 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:23:10" (3/3) ... [2024-10-12 00:23:10,365 INFO L332 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2024-10-12 00:23:10,417 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:23:10,417 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:23:10,417 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:23:10,417 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:23:10,417 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:23:10,417 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:23:10,418 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:23:10,418 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:23:10,422 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-10-12 00:23:10,438 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-10-12 00:23:10,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:10,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:10,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:23:10,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:10,444 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:23:10,445 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-10-12 00:23:10,447 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-10-12 00:23:10,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:10,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:10,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:23:10,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:10,458 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(40);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-10-12 00:23:10,458 INFO L747 eck$LassoCheckResult]: Loop: 18#L34-3true assume !!(main_~i~1#1 < 10);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-10-12 00:23:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:23:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656598763] [2024-10-12 00:23:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:23:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067172860] [2024-10-12 00:23:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:23:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177664402] [2024-10-12 00:23:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:10,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:11,071 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:23:11,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:23:11,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:23:11,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:23:11,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:23:11,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:23:11,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:23:11,075 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2024-10-12 00:23:11,075 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:23:11,075 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:23:11,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,559 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:23:11,564 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:23:11,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:23:11,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:11,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:11,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:11,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:23:11,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:23:11,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:11,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:11,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:11,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:23:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:23:11,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:11,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:11,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:11,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:23:11,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:11,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:11,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:23:11,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:23:11,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:11,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:11,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:11,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:23:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:23:11,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:11,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:11,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:11,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:23:11,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:23:11,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:11,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:11,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:23:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:23:11,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:11,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:11,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:23:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:23:11,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:11,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:11,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:11,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:11,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:11,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:11,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:11,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:11,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:23:11,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:11,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:11,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:23:11,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:12,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:12,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:23:12,050 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:23:12,050 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:23:12,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:23:12,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:23:12,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:23:12,096 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:23:12,097 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) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-12 00:23:12,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:23:12,121 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:23:12,132 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:23:12,133 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:23:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:23:12,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:12,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:23:12,251 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-10-12 00:23:12,307 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-10-12 00:23:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:23:12,315 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-10-12 00:23:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-10-12 00:23:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:23:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:23:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:23:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 93 transitions. [2024-10-12 00:23:12,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 25 states and 36 transitions. [2024-10-12 00:23:12,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-12 00:23:12,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:23:12,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 36 transitions. [2024-10-12 00:23:12,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:12,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:23:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 36 transitions. [2024-10-12 00:23:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-12 00:23:12,367 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-10-12 00:23:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-10-12 00:23:12,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:23:12,368 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:23:12,369 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:23:12,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-10-12 00:23:12,369 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:12,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:12,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:23:12,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:12,370 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(40);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 < 10); 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-10-12 00:23:12,370 INFO L747 eck$LassoCheckResult]: Loop: 154#L20-3 assume !!(max_~i~0#1 < 10);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-10-12 00:23:12,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-12 00:23:12,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493712353] [2024-10-12 00:23:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493712353] [2024-10-12 00:23:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493712353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:23:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:23:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687140106] [2024-10-12 00:23:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:12,471 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:12,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2024-10-12 00:23:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914687942] [2024-10-12 00:23:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:23:12,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:23:12,574 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-10-12 00:23:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:12,596 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-10-12 00:23:12,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2024-10-12 00:23:12,597 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2024-10-12 00:23:12,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:23:12,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:23:12,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2024-10-12 00:23:12,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:12,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-12 00:23:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2024-10-12 00:23:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-12 00:23:12,601 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-10-12 00:23:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-12 00:23:12,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-12 00:23:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:23:12,603 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-12 00:23:12,603 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:23:12,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-10-12 00:23:12,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:12,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:12,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:23:12,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:12,605 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(40);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 < 10);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 < 10); 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-10-12 00:23:12,605 INFO L747 eck$LassoCheckResult]: Loop: 211#L20-3 assume !!(max_~i~0#1 < 10);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-10-12 00:23:12,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-12 00:23:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107637742] [2024-10-12 00:23:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107637742] [2024-10-12 00:23:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107637742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893819497] [2024-10-12 00:23:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 00:23:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:23:12,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893819497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:12,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:23:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155706821] [2024-10-12 00:23:12,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:12,745 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2024-10-12 00:23:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176000258] [2024-10-12 00:23:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:12,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:23:12,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:23:12,843 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-10-12 00:23:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:12,874 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-10-12 00:23:12,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2024-10-12 00:23:12,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2024-10-12 00:23:12,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:23:12,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:23:12,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2024-10-12 00:23:12,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:12,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-12 00:23:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2024-10-12 00:23:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 00:23:12,878 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-10-12 00:23:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-12 00:23:12,879 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-12 00:23:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:23:12,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-12 00:23:12,880 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:23:12,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2024-10-12 00:23:12,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:12,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:12,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:12,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-12 00:23:12,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:12,881 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(40);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 < 10);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 < 10);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 < 10);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 < 10);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 < 10); 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-10-12 00:23:12,882 INFO L747 eck$LassoCheckResult]: Loop: 307#L20-3 assume !!(max_~i~0#1 < 10);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-10-12 00:23:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-12 00:23:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541177977] [2024-10-12 00:23:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541177977] [2024-10-12 00:23:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541177977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145979401] [2024-10-12 00:23:13,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:23:13,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:13,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:13,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:13,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 00:23:13,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:23:13,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:23:13,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:13,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:13,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:13,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145979401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:13,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:13,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:23:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398433155] [2024-10-12 00:23:13,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:13,228 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2024-10-12 00:23:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153302061] [2024-10-12 00:23:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:13,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:23:13,314 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-10-12 00:23:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:13,413 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-10-12 00:23:13,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2024-10-12 00:23:13,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:13,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2024-10-12 00:23:13,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:23:13,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:13,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-12 00:23:13,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2024-10-12 00:23:13,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:13,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-12 00:23:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2024-10-12 00:23:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-12 00:23:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-12 00:23:13,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-12 00:23:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:23:13,428 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-12 00:23:13,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:23:13,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2024-10-12 00:23:13,430 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-10-12 00:23:13,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:13,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:13,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-10-12 00:23:13,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:13,434 INFO L745 eck$LassoCheckResult]: Stem: 480#$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); 470#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(40);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; 471#L34-3 assume !!(main_~i~1#1 < 10);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; 483#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 484#L34-3 assume !!(main_~i~1#1 < 10);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; 474#L34-3 assume !!(main_~i~1#1 < 10);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; 500#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 499#L34-3 assume !!(main_~i~1#1 < 10);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; 498#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 497#L34-3 assume !!(main_~i~1#1 < 10);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; 496#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 495#L34-3 assume !!(main_~i~1#1 < 10);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; 494#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 493#L34-3 assume !!(main_~i~1#1 < 10);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; 492#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 491#L34-3 assume !!(main_~i~1#1 < 10);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; 490#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 489#L34-3 assume !!(main_~i~1#1 < 10);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; 488#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 487#L34-3 assume !!(main_~i~1#1 < 10);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; 486#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 485#L34-3 assume !(main_~i~1#1 < 10); 462#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; 463#L20-3 [2024-10-12 00:23:13,434 INFO L747 eck$LassoCheckResult]: Loop: 463#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 477#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; 478#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; 479#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 463#L20-3 [2024-10-12 00:23:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-10-12 00:23:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368014389] [2024-10-12 00:23:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2024-10-12 00:23:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685752779] [2024-10-12 00:23:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1776090044, now seen corresponding path program 1 times [2024-10-12 00:23:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17803320] [2024-10-12 00:23:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:17,202 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:23:17,203 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:23:17,203 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:23:17,203 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:23:17,203 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:23:17,203 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:17,203 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:23:17,203 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:23:17,203 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration5_Lasso [2024-10-12 00:23:17,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:23:17,204 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:23:17,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:17,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:23:17,911 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:23:17,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:17,914 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:17,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:23:17,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:17,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:17,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:17,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:17,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:17,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:17,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:17,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:17,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:17,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:23:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:17,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:17,957 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:17,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:23:17,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:17,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:17,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:17,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:17,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:17,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:17,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:17,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:17,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:17,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:17,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:17,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:17,986 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:23:17,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:17,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:17,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:17,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:17,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:18,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:18,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:23:18,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:23:18,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:18,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:18,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:23:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,070 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:23:18,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:18,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:18,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:18,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:23:18,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,110 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:23:18,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:18,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:18,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:18,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,155 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:23:18,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:18,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:18,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:18,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:23:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,196 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:23:18,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:18,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:18,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:18,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:23:18,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,240 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:23:18,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:18,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:18,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:18,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:18,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:18,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:18,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:18,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:23:18,292 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:23:18,293 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:23:18,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:18,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,295 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:23:18,298 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:23:18,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:23:18,312 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:23:18,312 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2) = -8*ULTIMATE.start_max_~i~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 Supporting invariants [] [2024-10-12 00:23:18,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:18,350 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:23:18,352 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:23:18,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:23:18,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:18,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:18,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:18,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:23:18,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:18,494 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:23:18,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 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-10-12 00:23:18,534 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 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 47 states and 57 transitions. Complement of second has 5 states. [2024-10-12 00:23:18,535 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-10-12 00:23:18,536 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-10-12 00:23:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-12 00:23:18,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 24 letters. Loop has 4 letters. [2024-10-12 00:23:18,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:18,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-12 00:23:18,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:18,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 24 letters. Loop has 8 letters. [2024-10-12 00:23:18,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:18,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2024-10-12 00:23:18,539 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:18,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 44 states and 52 transitions. [2024-10-12 00:23:18,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:23:18,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:23:18,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2024-10-12 00:23:18,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:18,540 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-12 00:23:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2024-10-12 00:23:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-12 00:23:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-12 00:23:18,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-12 00:23:18,543 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-12 00:23:18,544 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:23:18,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2024-10-12 00:23:18,544 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:18,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:18,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:18,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:18,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:18,546 INFO L745 eck$LassoCheckResult]: Stem: 712#$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); 701#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(40);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; 702#L34-3 assume !!(main_~i~1#1 < 10);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; 715#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 716#L34-3 assume !!(main_~i~1#1 < 10);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; 704#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 705#L34-3 assume !!(main_~i~1#1 < 10);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; 732#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 731#L34-3 assume !!(main_~i~1#1 < 10);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; 730#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 729#L34-3 assume !!(main_~i~1#1 < 10);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; 728#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 727#L34-3 assume !!(main_~i~1#1 < 10);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; 726#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 725#L34-3 assume !!(main_~i~1#1 < 10);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; 724#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 723#L34-3 assume !!(main_~i~1#1 < 10);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; 722#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 721#L34-3 assume !!(main_~i~1#1 < 10);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; 720#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 719#L34-3 assume !!(main_~i~1#1 < 10);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; 718#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 717#L34-3 assume !(main_~i~1#1 < 10); 693#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; 694#L20-3 assume !(max_~i~0#1 < 10); 703#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); 700#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; 699#L20-8 [2024-10-12 00:23:18,546 INFO L747 eck$LassoCheckResult]: Loop: 699#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 689#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; 690#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; 706#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 699#L20-8 [2024-10-12 00:23:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178489, now seen corresponding path program 1 times [2024-10-12 00:23:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648931512] [2024-10-12 00:23:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648931512] [2024-10-12 00:23:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648931512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:23:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:23:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501575443] [2024-10-12 00:23:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:18,651 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2024-10-12 00:23:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794800689] [2024-10-12 00:23:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:18,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:18,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:18,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:23:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:23:18,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:23:18,760 INFO L87 Difference]: Start difference. First operand 44 states and 52 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-10-12 00:23:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:18,809 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-12 00:23:18,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2024-10-12 00:23:18,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:18,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 65 transitions. [2024-10-12 00:23:18,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:23:18,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:23:18,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2024-10-12 00:23:18,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:18,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-12 00:23:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2024-10-12 00:23:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-10-12 00:23:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:18,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-12 00:23:18,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-12 00:23:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:23:18,819 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-12 00:23:18,820 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:23:18,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2024-10-12 00:23:18,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:18,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:18,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:18,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:18,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:18,824 INFO L745 eck$LassoCheckResult]: Stem: 817#$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); 806#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(40);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; 807#L34-3 assume !!(main_~i~1#1 < 10);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; 809#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 810#L34-3 assume !!(main_~i~1#1 < 10);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; 821#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 838#L34-3 assume !!(main_~i~1#1 < 10);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; 837#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 836#L34-3 assume !!(main_~i~1#1 < 10);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; 835#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 834#L34-3 assume !!(main_~i~1#1 < 10);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; 833#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 832#L34-3 assume !!(main_~i~1#1 < 10);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; 831#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 830#L34-3 assume !!(main_~i~1#1 < 10);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; 829#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 828#L34-3 assume !!(main_~i~1#1 < 10);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; 827#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 826#L34-3 assume !!(main_~i~1#1 < 10);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; 825#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 824#L34-3 assume !!(main_~i~1#1 < 10);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; 823#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 822#L34-3 assume !(main_~i~1#1 < 10); 798#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; 799#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 813#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 814#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; 815#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 816#L20-3 assume !(max_~i~0#1 < 10); 808#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); 805#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; 804#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 794#L21-3 [2024-10-12 00:23:18,824 INFO L747 eck$LassoCheckResult]: Loop: 794#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; 795#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; 811#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 820#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 794#L21-3 [2024-10-12 00:23:18,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1922451645, now seen corresponding path program 1 times [2024-10-12 00:23:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699095361] [2024-10-12 00:23:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699095361] [2024-10-12 00:23:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699095361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501693979] [2024-10-12 00:23:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:18,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:18,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:23:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:19,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:23:19,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:19,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501693979] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:19,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:23:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021397762] [2024-10-12 00:23:19,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:19,080 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:19,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2024-10-12 00:23:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154131759] [2024-10-12 00:23:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:19,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:19,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:19,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:23:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:23:19,161 INFO L87 Difference]: Start difference. First operand 45 states and 52 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-10-12 00:23:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:19,231 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-10-12 00:23:19,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 98 transitions. [2024-10-12 00:23:19,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:19,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 98 transitions. [2024-10-12 00:23:19,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-12 00:23:19,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-12 00:23:19,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 98 transitions. [2024-10-12 00:23:19,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:19,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-10-12 00:23:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 98 transitions. [2024-10-12 00:23:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2024-10-12 00:23:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 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-10-12 00:23:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2024-10-12 00:23:19,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 82 transitions. [2024-10-12 00:23:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:23:19,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2024-10-12 00:23:19,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:23:19,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 82 transitions. [2024-10-12 00:23:19,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:19,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:19,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:19,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:19,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:19,241 INFO L745 eck$LassoCheckResult]: Stem: 1143#$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); 1130#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(40);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; 1131#L34-3 assume !!(main_~i~1#1 < 10);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; 1133#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1134#L34-3 assume !!(main_~i~1#1 < 10);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; 1147#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1184#L34-3 assume !!(main_~i~1#1 < 10);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; 1182#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1180#L34-3 assume !!(main_~i~1#1 < 10);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; 1178#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1176#L34-3 assume !!(main_~i~1#1 < 10);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; 1174#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1170#L34-3 assume !!(main_~i~1#1 < 10);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; 1169#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1168#L34-3 assume !!(main_~i~1#1 < 10);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; 1166#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1164#L34-3 assume !!(main_~i~1#1 < 10);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; 1162#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1160#L34-3 assume !!(main_~i~1#1 < 10);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; 1158#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1156#L34-3 assume !!(main_~i~1#1 < 10);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; 1154#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1153#L34-3 assume !(main_~i~1#1 < 10); 1121#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; 1122#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1138#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1144#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; 1142#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1139#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1140#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1141#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; 1167#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1165#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1163#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1161#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; 1159#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1157#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1151#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1155#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; 1152#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1150#L20-3 assume !(max_~i~0#1 < 10); 1132#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); 1128#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; 1129#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1185#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1135#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; 1136#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1127#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1117#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1118#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; 1183#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1181#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1179#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1177#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; 1175#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1173#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1149#L21-3 [2024-10-12 00:23:19,242 INFO L747 eck$LassoCheckResult]: Loop: 1149#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; 1172#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; 1171#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1148#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1149#L21-3 [2024-10-12 00:23:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1948283363, now seen corresponding path program 1 times [2024-10-12 00:23:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:19,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743885780] [2024-10-12 00:23:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-12 00:23:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743885780] [2024-10-12 00:23:19,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743885780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082581605] [2024-10-12 00:23:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:19,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:19,371 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:19,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:23:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:19,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:19,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-12 00:23:19,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-12 00:23:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082581605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:19,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:19,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:23:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706042682] [2024-10-12 00:23:19,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:19,586 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2024-10-12 00:23:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232683568] [2024-10-12 00:23:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:19,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:19,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:19,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:23:19,692 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. cyclomatic complexity: 18 Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:19,886 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2024-10-12 00:23:19,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 188 transitions. [2024-10-12 00:23:19,888 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:19,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 188 transitions. [2024-10-12 00:23:19,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-10-12 00:23:19,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-12 00:23:19,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 188 transitions. [2024-10-12 00:23:19,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:19,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 188 transitions. [2024-10-12 00:23:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 188 transitions. [2024-10-12 00:23:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2024-10-12 00:23:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2024-10-12 00:23:19,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 142 transitions. [2024-10-12 00:23:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:23:19,922 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 142 transitions. [2024-10-12 00:23:19,922 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:23:19,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 142 transitions. [2024-10-12 00:23:19,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-10-12 00:23:19,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:19,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:19,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:19,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:23:19,928 INFO L745 eck$LassoCheckResult]: Stem: 1712#$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); 1699#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(40);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; 1700#L34-3 assume !!(main_~i~1#1 < 10);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; 1702#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1703#L34-3 assume !!(main_~i~1#1 < 10);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; 1717#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1754#L34-3 assume !!(main_~i~1#1 < 10);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; 1752#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1750#L34-3 assume !!(main_~i~1#1 < 10);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; 1748#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1746#L34-3 assume !!(main_~i~1#1 < 10);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; 1744#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1742#L34-3 assume !!(main_~i~1#1 < 10);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; 1740#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1738#L34-3 assume !!(main_~i~1#1 < 10);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; 1736#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1734#L34-3 assume !!(main_~i~1#1 < 10);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; 1732#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 < 10);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; 1728#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1726#L34-3 assume !!(main_~i~1#1 < 10);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; 1724#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1723#L34-3 assume !(main_~i~1#1 < 10); 1690#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; 1691#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1706#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1781#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; 1779#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1707#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1708#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1709#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; 1710#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1711#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1776#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1774#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; 1772#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1770#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1768#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1766#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; 1764#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1763#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1761#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1759#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; 1757#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1756#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1755#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; 1753#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1751#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1749#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1747#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; 1745#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1743#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1741#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1739#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; 1737#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1735#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1733#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1731#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; 1729#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1727#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1721#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1725#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; 1722#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1720#L20-3 assume !(max_~i~0#1 < 10); 1701#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); 1698#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; 1696#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1697#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1802#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; 1715#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1716#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1686#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1687#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; 1704#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1801#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1800#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1799#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; 1798#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1797#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1796#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1795#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; 1794#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1793#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1792#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1791#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; 1790#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1789#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1788#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1787#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; 1786#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1785#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1784#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1783#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; 1782#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1780#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1778#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1777#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; 1775#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1773#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1771#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1769#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; 1767#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1765#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1719#L21-3 [2024-10-12 00:23:19,930 INFO L747 eck$LassoCheckResult]: Loop: 1719#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; 1762#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; 1760#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1718#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1719#L21-3 [2024-10-12 00:23:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2012806109, now seen corresponding path program 2 times [2024-10-12 00:23:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264004724] [2024-10-12 00:23:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:20,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:20,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:20,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2024-10-12 00:23:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481819903] [2024-10-12 00:23:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:20,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:20,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1723510376, now seen corresponding path program 1 times [2024-10-12 00:23:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578337902] [2024-10-12 00:23:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 37 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-12 00:23:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:20,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578337902] [2024-10-12 00:23:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578337902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:20,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952467093] [2024-10-12 00:23:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:20,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:20,524 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-12 00:23:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:20,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:23:20,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-12 00:23:20,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:23:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952467093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:23:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-10-12 00:23:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657983068] [2024-10-12 00:23:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:23:20,872 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. cyclomatic complexity: 30 Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:21,146 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2024-10-12 00:23:21,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 185 transitions. [2024-10-12 00:23:21,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:23:21,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 112 states and 133 transitions. [2024-10-12 00:23:21,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-12 00:23:21,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2024-10-12 00:23:21,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 133 transitions. [2024-10-12 00:23:21,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:21,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-10-12 00:23:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 133 transitions. [2024-10-12 00:23:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-12 00:23:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1875) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-10-12 00:23:21,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-10-12 00:23:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:23:21,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-10-12 00:23:21,166 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:23:21,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 133 transitions. [2024-10-12 00:23:21,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:23:21,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:21,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:21,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:21,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:21,170 INFO L745 eck$LassoCheckResult]: Stem: 2317#$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); 2307#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(40);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; 2308#L34-3 assume !!(main_~i~1#1 < 10);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; 2319#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2320#L34-3 assume !!(main_~i~1#1 < 10);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; 2310#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2311#L34-3 assume !!(main_~i~1#1 < 10);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; 2408#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2407#L34-3 assume !!(main_~i~1#1 < 10);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; 2406#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2405#L34-3 assume !!(main_~i~1#1 < 10);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; 2404#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2403#L34-3 assume !!(main_~i~1#1 < 10);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; 2402#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2401#L34-3 assume !!(main_~i~1#1 < 10);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; 2400#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2399#L34-3 assume !!(main_~i~1#1 < 10);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; 2398#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2397#L34-3 assume !!(main_~i~1#1 < 10);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; 2396#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2395#L34-3 assume !!(main_~i~1#1 < 10);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; 2394#L34-2 main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2393#L34-3 assume !(main_~i~1#1 < 10); 2301#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; 2302#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2313#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2314#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; 2315#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2316#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2391#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2389#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; 2387#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2385#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2383#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2381#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; 2379#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2377#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2375#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2373#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; 2371#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2369#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2367#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2365#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; 2363#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2361#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2359#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2357#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; 2355#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2353#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2351#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2349#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; 2347#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2345#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2343#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2341#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; 2339#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2337#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2335#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2333#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; 2331#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2329#L20-3 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2327#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2325#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; 2323#L20-2 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2322#L20-3 assume !(max_~i~0#1 < 10); 2309#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); 2306#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; 2305#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2297#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2298#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; 2312#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2318#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2392#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2390#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; 2388#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2386#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2384#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2382#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; 2380#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2378#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2376#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2374#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; 2372#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2370#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2368#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2366#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; 2364#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2362#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2360#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2358#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; 2356#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2354#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2352#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2350#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; 2348#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2346#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2344#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2342#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; 2340#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2338#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2336#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2334#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; 2332#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2330#L20-8 assume !!(max_~i~0#1 < 10);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2328#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2326#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; 2324#L20-7 max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2321#L20-8 assume !(max_~i~0#1 < 10); 2299#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); 2300#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; 2304#L43-3 [2024-10-12 00:23:21,171 INFO L747 eck$LassoCheckResult]: Loop: 2304#L43-3 assume !!(main_~i~2#1 < 9);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; 2303#L43-2 main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 2304#L43-3 [2024-10-12 00:23:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1621163222, now seen corresponding path program 1 times [2024-10-12 00:23:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241090620] [2024-10-12 00:23:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2024-10-12 00:23:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382962104] [2024-10-12 00:23:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:21,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1135269864, now seen corresponding path program 1 times [2024-10-12 00:23:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16934145] [2024-10-12 00:23:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:21,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:39,185 WARN L286 SmtUtils]: Spent 17.61s on a formula simplification. DAG size of input: 615 DAG size of output: 468 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:23:40,844 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:23:40,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:23:40,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:23:40,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:23:40,845 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:23:40,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:40,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:23:40,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:23:40,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration10_Lasso [2024-10-12 00:23:40,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:23:40,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:23:40,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:40,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:41,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:23:41,776 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:23:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,778 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:23:41,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:23:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,824 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:23:41,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:23:41,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,850 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:23:41,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,878 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:23:41,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:23:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,909 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:23:41,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:23:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,934 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:23:41,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:41,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:23:41,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:41,980 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:41,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:23:41,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:41,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:41,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:41,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:41,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:41,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:41,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:41,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:41,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:23:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,006 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:23:42,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:23:42,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,036 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:23:42,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:23:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,063 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:23:42,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-12 00:23:42,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,092 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:23:42,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,128 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:23:42,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,161 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:23:42,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,188 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:23:42,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:23:42,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,214 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:23:42,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,240 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:23:42,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:23:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,266 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:23:42,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,297 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:23:42,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:23:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,324 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:23:42,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:23:42,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,351 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:23:42,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,383 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:23:42,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,408 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:23:42,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:23:42,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,433 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:23:42,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-12 00:23:42,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,461 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:23:42,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:23:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,486 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:23:42,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:23:42,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,513 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:23:42,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 00:23:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,539 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:23:42,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 00:23:42,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,566 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:23:42,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:42,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:42,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:42,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:23:42,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,591 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:23:42,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:23:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,622 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:23:42,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:23:42,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,651 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:23:42,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 00:23:42,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,678 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:23:42,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:23:42,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,709 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:23:42,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:23:42,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,737 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:23:42,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:23:42,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,766 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:23:42,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,795 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:23:42,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,827 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:23:42,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,855 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:23:42,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,891 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:23:42,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,934 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:23:42,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-10-12 00:23:42,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:42,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:42,974 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:42,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:23:42,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:42,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:42,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:42,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:42,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:42,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:42,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:42,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:43,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:43,010 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:43,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:23:43,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:43,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:43,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:43,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:43,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:43,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:43,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:43,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:43,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:23:43,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:43,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:43,048 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:43,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:23:43,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:43,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:43,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:43,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:43,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:43,075 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:23:43,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:43,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:43,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:43,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:43,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:43,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:43,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:43,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:23:43,105 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:23:43,105 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:23:43,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:43,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:43,108 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:43,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:23:43,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:23:43,120 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:23:43,120 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:23:43,120 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1) = -2*ULTIMATE.start_main_~i~2#1 + 17 Supporting invariants [] [2024-10-12 00:23:43,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-12 00:23:43,145 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:23:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:43,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:23:43,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:43,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:23:43,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:43,419 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:23:43,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23 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-10-12 00:23:43,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 133 transitions. cyclomatic complexity: 23. 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 114 states and 136 transitions. Complement of second has 4 states. [2024-10-12 00:23:43,435 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-10-12 00:23:43,436 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-10-12 00:23:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-10-12 00:23:43,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 2 letters. [2024-10-12 00:23:43,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:43,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 112 letters. Loop has 2 letters. [2024-10-12 00:23:43,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:43,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 110 letters. Loop has 4 letters. [2024-10-12 00:23:43,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:43,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 136 transitions. [2024-10-12 00:23:43,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:23:43,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2024-10-12 00:23:43,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:23:43,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:23:43,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:23:43,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:43,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:23:43,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:23:43,439 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:23:43,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:23:43,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:23:43,440 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:23:43,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:23:43,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:23:43 BoogieIcfgContainer [2024-10-12 00:23:43,446 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:23:43,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:23:43,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:23:43,447 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:23:43,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:23:10" (3/4) ... [2024-10-12 00:23:43,449 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:23:43,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:23:43,450 INFO L158 Benchmark]: Toolchain (without parser) took 34008.85ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 106.2MB in the beginning and 177.8MB in the end (delta: -71.6MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,450 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 131.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:23:43,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.10ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 93.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.99ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 91.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:23:43,451 INFO L158 Benchmark]: Boogie Preprocessor took 75.11ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 146.9MB in the end (delta: -55.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,451 INFO L158 Benchmark]: RCFGBuilder took 468.58ms. Allocated memory is still 176.2MB. Free memory was 146.9MB in the beginning and 130.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,451 INFO L158 Benchmark]: BuchiAutomizer took 33088.59ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 130.6MB in the beginning and 178.8MB in the end (delta: -48.3MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,452 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 343.9MB. Free memory was 178.8MB in the beginning and 177.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:23:43,453 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.20ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 131.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.10ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 93.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.99ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 91.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.11ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 146.9MB in the end (delta: -55.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 468.58ms. Allocated memory is still 176.2MB. Free memory was 146.9MB in the beginning and 130.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 33088.59ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 130.6MB in the beginning and 178.8MB in the end (delta: -48.3MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 343.9MB. Free memory was 178.8MB in the beginning and 177.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 null and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 17) and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.0s and 11 iterations. TraceHistogramMax:10. Analysis of lassos took 31.3s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 61 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, 429 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 259 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital292 mio100 ax100 hnf100 lsp93 ukn47 mio100 lsp38 div100 bol100 ite100 ukn100 eq151 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms 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-10-12 00:23:43,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-12 00:23:43,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:43,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-12 00:23:44,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-12 00:23:44,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:44,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-12 00:23:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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