./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:20:09,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:20:09,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:20:09,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:20:09,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:20:10,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:20:10,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:20:10,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:20:10,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:20:10,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:20:10,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:20:10,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:20:10,013 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:20:10,014 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:20:10,015 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:20:10,015 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:20:10,017 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:20:10,018 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:20:10,018 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:20:10,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:20:10,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:20:10,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:20:10,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:20:10,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:20:10,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:20:10,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:20:10,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:20:10,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:20:10,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:20:10,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:20:10,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:20:10,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:20:10,026 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:20:10,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:20:10,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:20:10,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:20:10,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:20:10,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:20:10,028 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:20:10,028 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2024-11-20 22:20:10,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:20:10,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:20:10,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:20:10,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:20:10,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:20:10,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2024-11-20 22:20:11,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:20:11,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:20:11,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2024-11-20 22:20:11,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7db373b/33375ca13e474489b4f6f17c7bfe5e42/FLAG748360d5c [2024-11-20 22:20:12,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7db373b/33375ca13e474489b4f6f17c7bfe5e42 [2024-11-20 22:20:12,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:20:12,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:20:12,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:20:12,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:20:12,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:20:12,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2867d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12, skipping insertion in model container [2024-11-20 22:20:12,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:20:12,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:20:12,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:20:12,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:20:12,549 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:20:12,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12 WrapperNode [2024-11-20 22:20:12,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:20:12,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:20:12,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:20:12,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:20:12,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,590 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-20 22:20:12,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:20:12,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:20:12,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:20:12,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:20:12,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,633 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-20 22:20:12,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:20:12,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:20:12,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:20:12,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:20:12,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (1/1) ... [2024-11-20 22:20:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:12,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:12,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:20:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:20:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:20:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:20:12,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:20:12,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:20:12,793 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:20:12,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:20:13,008 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-20 22:20:13,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:20:13,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:20:13,023 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 22:20:13,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:13 BoogieIcfgContainer [2024-11-20 22:20:13,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:20:13,025 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:20:13,025 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:20:13,029 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:20:13,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:13,030 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:20:12" (1/3) ... [2024-11-20 22:20:13,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:20:13, skipping insertion in model container [2024-11-20 22:20:13,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:13,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:12" (2/3) ... [2024-11-20 22:20:13,032 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f96c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:20:13, skipping insertion in model container [2024-11-20 22:20:13,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:13,033 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:13" (3/3) ... [2024-11-20 22:20:13,034 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2024-11-20 22:20:13,090 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:20:13,090 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:20:13,090 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:20:13,090 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:20:13,090 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:20:13,090 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:20:13,090 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:20:13,091 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:20:13,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:13,107 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-20 22:20:13,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:13,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:13,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:20:13,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:13,111 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:20:13,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:13,113 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-20 22:20:13,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:13,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:13,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:20:13,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:13,120 INFO L745 eck$LassoCheckResult]: Stem: 25#$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); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 17#L34-3true [2024-11-20 22:20:13,121 INFO L747 eck$LassoCheckResult]: Loop: 17#L34-3true assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 13#L34-2true main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 17#L34-3true [2024-11-20 22:20:13,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-20 22:20:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662957019] [2024-11-20 22:20:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:13,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-20 22:20:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135046933] [2024-11-20 22:20:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:13,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-20 22:20:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273508002] [2024-11-20 22:20:13,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:13,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:13,689 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:13,690 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:13,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:13,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:13,691 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:13,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:13,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:13,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:13,692 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2024-11-20 22:20:13,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:13,693 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:13,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:13,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:14,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:20:14,161 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:20:14,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:20:14,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:20:14,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:20:14,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-20 22:20:14,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:20:14,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:20:14,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-20 22:20:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:20:14,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:20:14,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:20:14,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:20:14,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:20:14,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:20:14,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-20 22:20:14,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:20:14,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:20:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:20:14,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:20:14,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,500 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:20:14,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,522 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:20:14,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:20:14,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,573 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:20:14,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,602 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:20:14,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,625 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:20:14,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:20:14,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,650 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:20:14,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:14,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:14,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:14,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:20:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,679 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:20:14,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-20 22:20:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,718 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:20:14,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-20 22:20:14,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,757 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:20:14,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:14,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,790 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:20:14,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:14,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:14,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:14,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:14,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:14,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:14,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:14,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:20:14,857 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-20 22:20:14,857 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-20 22:20:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:14,886 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:14,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:20:14,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:20:14,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:20:14,906 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:20:14,907 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-11-20 22:20:14,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:14,926 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:20:14,936 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:20:14,937 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:20:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:14,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:20:14,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:14,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:20:14,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,065 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:20:15,067 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 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). 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 52 states and 75 transitions. Complement of second has 6 states. [2024-11-20 22:20:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:20:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-20 22:20:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-20 22:20:15,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-20 22:20:15,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-20 22:20:15,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:15,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 75 transitions. [2024-11-20 22:20:15,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 19 states and 27 transitions. [2024-11-20 22:20:15,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-20 22:20:15,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:20:15,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2024-11-20 22:20:15,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:15,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-20 22:20:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2024-11-20 22:20:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-20 22:20:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-11-20 22:20:15,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-20 22:20:15,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-20 22:20:15,151 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:20:15,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2024-11-20 22:20:15,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:15,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:15,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-20 22:20:15,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:15,152 INFO L745 eck$LassoCheckResult]: Stem: 149#$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); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 142#L34-3 assume !(main_~i~1#1 < 10); 134#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 135#L20-3 [2024-11-20 22:20:15,152 INFO L747 eck$LassoCheckResult]: Loop: 135#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 148#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 135#L20-3 [2024-11-20 22:20:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-20 22:20:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952361528] [2024-11-20 22:20:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:15,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-20 22:20:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:15,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952361528] [2024-11-20 22:20:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952361528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:20:15,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:20:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:20:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263333204] [2024-11-20 22:20:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:20:15,244 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2024-11-20 22:20:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614763433] [2024-11-20 22:20:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:20:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:20:15,309 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:15,321 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-20 22:20:15,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-20 22:20:15,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2024-11-20 22:20:15,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-20 22:20:15,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:20:15,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-11-20 22:20:15,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:15,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-20 22:20:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-11-20 22:20:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-20 22:20:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-20 22:20:15,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-20 22:20:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:20:15,326 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-20 22:20:15,326 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:20:15,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2024-11-20 22:20:15,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:15,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:15,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:20:15,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:15,328 INFO L745 eck$LassoCheckResult]: Stem: 194#$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); 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 187#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 190#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 191#L34-3 assume !(main_~i~1#1 < 10); 179#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 180#L20-3 [2024-11-20 22:20:15,328 INFO L747 eck$LassoCheckResult]: Loop: 180#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 193#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 180#L20-3 [2024-11-20 22:20:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-20 22:20:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251881168] [2024-11-20 22:20:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251881168] [2024-11-20 22:20:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251881168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325696635] [2024-11-20 22:20:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:15,404 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-20 22:20:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:15,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:20:15,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:20:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325696635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:20:15,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:20:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 22:20:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434886977] [2024-11-20 22:20:15,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:20:15,489 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2024-11-20 22:20:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45825747] [2024-11-20 22:20:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:20:15,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:20:15,561 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:15,586 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-20 22:20:15,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2024-11-20 22:20:15,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2024-11-20 22:20:15,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-20 22:20:15,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:20:15,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2024-11-20 22:20:15,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:15,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:20:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2024-11-20 22:20:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-20 22:20:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-20 22:20:15,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:20:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:20:15,592 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:20:15,592 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:20:15,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-11-20 22:20:15,593 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:15,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:15,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-20 22:20:15,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:15,594 INFO L745 eck$LassoCheckResult]: Stem: 278#$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); 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 271#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 279#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 280#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 274#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 275#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 284#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 283#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 282#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 281#L34-3 assume !(main_~i~1#1 < 10); 263#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 264#L20-3 [2024-11-20 22:20:15,594 INFO L747 eck$LassoCheckResult]: Loop: 264#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 277#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 264#L20-3 [2024-11-20 22:20:15,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-20 22:20:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918948111] [2024-11-20 22:20:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918948111] [2024-11-20 22:20:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918948111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927804636] [2024-11-20 22:20:15,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:20:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:15,741 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:15,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-20 22:20:15,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:20:15,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:20:15,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:20:15,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:20:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:15,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927804636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:20:15,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:20:15,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 22:20:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072865356] [2024-11-20 22:20:15,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:20:15,906 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:15,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2024-11-20 22:20:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429426891] [2024-11-20 22:20:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:15,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:15,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:20:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:20:15,954 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 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-11-20 22:20:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:15,993 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-20 22:20:15,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2024-11-20 22:20:15,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:15,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2024-11-20 22:20:15,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-20 22:20:15,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:20:15,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2024-11-20 22:20:15,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:15,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-20 22:20:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2024-11-20 22:20:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-20 22:20:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-20 22:20:15,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-20 22:20:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:20:15,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-20 22:20:15,999 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:20:16,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2024-11-20 22:20:16,000 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:16,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:16,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:16,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-20 22:20:16,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:16,001 INFO L745 eck$LassoCheckResult]: Stem: 422#$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); 414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 415#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 423#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 424#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 418#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 419#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 440#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 439#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 438#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 437#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 436#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 435#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 434#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 433#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 432#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 431#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 430#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 429#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 428#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 427#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 426#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 425#L34-3 assume !(main_~i~1#1 < 10); 407#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 408#L20-3 [2024-11-20 22:20:16,001 INFO L747 eck$LassoCheckResult]: Loop: 408#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 421#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 408#L20-3 [2024-11-20 22:20:16,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-11-20 22:20:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568403483] [2024-11-20 22:20:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:16,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2024-11-20 22:20:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:16,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55879562] [2024-11-20 22:20:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2024-11-20 22:20:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155559703] [2024-11-20 22:20:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:16,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:19,860 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:19,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:19,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:19,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:19,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:19,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:19,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:19,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:19,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2024-11-20 22:20:19,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:19,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:19,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:19,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:20,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:20,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:20,464 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:20:20,465 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:20:20,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,467 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:20:20,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,488 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:20:20,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,509 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:20:20,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-20 22:20:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,532 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:20:20,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,552 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:20:20,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:20:20,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-20 22:20:20,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,603 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:20:20,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,632 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:20:20,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-20 22:20:20,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,659 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-20 22:20:20,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,689 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-20 22:20:20,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,716 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:20:20,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-20 22:20:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,747 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:20:20,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,769 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:20:20,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,790 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:20:20,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,812 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:20:20,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:20,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:20,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,836 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:20:20,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:20,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:20,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,864 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:20:20,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,894 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:20:20,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-20 22:20:20,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,924 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-20 22:20:20,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,956 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-20 22:20:20,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:20,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:20,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:20,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:20,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:20,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:20,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:20,982 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:20,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-20 22:20:20,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:20,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:20,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:20,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:20,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:20,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:20,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:20,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-20 22:20:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,010 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:20:21,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-11-20 22:20:21,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,044 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-20 22:20:21,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:21,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:21,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:21,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,074 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-20 22:20:21,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:21,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:21,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:21,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,103 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-20 22:20:21,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,137 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-20 22:20:21,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,168 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-20 22:20:21,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:21,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:21,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,198 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-20 22:20:21,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,229 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-20 22:20:21,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,261 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-20 22:20:21,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-20 22:20:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,285 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-20 22:20:21,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,310 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-20 22:20:21,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:21,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:21,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:21,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:21,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,330 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-20 22:20:21,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:21,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:21,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:21,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:21,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:21,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:21,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:21,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:20:21,373 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-20 22:20:21,373 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-20 22:20:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:21,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,375 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-20 22:20:21,377 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:20:21,391 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:20:21,391 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:20:21,392 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0#1) = -2*ULTIMATE.start_sum_~i~0#1 + 19 Supporting invariants [] [2024-11-20 22:20:21,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-20 22:20:21,415 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-20 22:20:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:21,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:20:21,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:21,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:20:21,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:21,507 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:20:21,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:21,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 39 states and 45 transitions. Complement of second has 5 states. [2024-11-20 22:20:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:20:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-20 22:20:21,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 2 letters. [2024-11-20 22:20:21,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:21,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 26 letters. Loop has 2 letters. [2024-11-20 22:20:21,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:21,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 4 letters. [2024-11-20 22:20:21,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:21,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-20 22:20:21,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:21,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. [2024-11-20 22:20:21,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-20 22:20:21,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-20 22:20:21,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2024-11-20 22:20:21,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:21,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-20 22:20:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2024-11-20 22:20:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 22:20:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-20 22:20:21,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-20 22:20:21,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-20 22:20:21,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:20:21,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2024-11-20 22:20:21,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:21,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:21,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:21,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:21,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:21,536 INFO L745 eck$LassoCheckResult]: Stem: 629#$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); 620#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 621#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 630#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 631#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 624#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 625#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 647#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 646#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 645#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 644#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 643#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 642#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 641#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 640#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 639#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 638#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 637#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 636#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 635#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 634#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 633#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 632#L34-3 assume !(main_~i~1#1 < 10); 613#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 614#L20-3 assume !(sum_~i~0#1 < 10); 622#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 623#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 618#L20-8 [2024-11-20 22:20:21,536 INFO L747 eck$LassoCheckResult]: Loop: 618#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 619#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 618#L20-8 [2024-11-20 22:20:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2024-11-20 22:20:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606170662] [2024-11-20 22:20:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 22:20:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606170662] [2024-11-20 22:20:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606170662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:20:21,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:20:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:20:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690971473] [2024-11-20 22:20:21,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:20:21,638 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2024-11-20 22:20:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:21,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564206112] [2024-11-20 22:20:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:21,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:21,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:20:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:20:21,682 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:21,707 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-20 22:20:21,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2024-11-20 22:20:21,707 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:21,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2024-11-20 22:20:21,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-20 22:20:21,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-20 22:20:21,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2024-11-20 22:20:21,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:21,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-20 22:20:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2024-11-20 22:20:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-20 22:20:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-20 22:20:21,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-20 22:20:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:20:21,711 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-20 22:20:21,711 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:20:21,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2024-11-20 22:20:21,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:21,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:21,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:21,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:21,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:21,713 INFO L745 eck$LassoCheckResult]: Stem: 716#$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); 707#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 708#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 711#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 712#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 718#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 735#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 734#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 733#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 732#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 731#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 730#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 729#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 728#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 727#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 726#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 725#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 724#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 723#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 722#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 721#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 720#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 719#L34-3 assume !(main_~i~1#1 < 10); 700#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 701#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 714#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 715#L20-3 assume !(sum_~i~0#1 < 10); 709#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 710#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 705#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 706#L20-7 [2024-11-20 22:20:21,713 INFO L747 eck$LassoCheckResult]: Loop: 706#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 717#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 706#L20-7 [2024-11-20 22:20:21,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2024-11-20 22:20:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280694140] [2024-11-20 22:20:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:21,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 22:20:21,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:21,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280694140] [2024-11-20 22:20:21,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280694140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:21,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874732434] [2024-11-20 22:20:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:21,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:21,851 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:21,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-20 22:20:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:21,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:20:21,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 22:20:21,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:20:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-20 22:20:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874732434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:20:21,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:20:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 22:20:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167436904] [2024-11-20 22:20:21,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:20:21,956 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2024-11-20 22:20:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:21,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214372167] [2024-11-20 22:20:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:21,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:21,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:20:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:20:22,005 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:22,074 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-20 22:20:22,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-11-20 22:20:22,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:22,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-11-20 22:20:22,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-20 22:20:22,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-20 22:20:22,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-11-20 22:20:22,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:22,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-20 22:20:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-11-20 22:20:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-11-20 22:20:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-20 22:20:22,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-20 22:20:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:20:22,081 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-20 22:20:22,081 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:20:22,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2024-11-20 22:20:22,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:22,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:22,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:22,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:22,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:22,084 INFO L745 eck$LassoCheckResult]: Stem: 998#$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); 988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 989#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1000#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1001#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 992#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 993#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1028#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1027#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1026#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1025#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1024#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1023#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1022#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1021#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1020#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1019#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1018#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1017#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1016#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1015#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1014#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1013#L34-3 assume !(main_~i~1#1 < 10); 981#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 982#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 995#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 996#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 997#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1012#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1011#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1009#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1006#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1005#L20-3 assume !(sum_~i~0#1 < 10); 990#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 991#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 986#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 987#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 999#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1010#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1008#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1007#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1004#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1003#L20-7 [2024-11-20 22:20:22,084 INFO L747 eck$LassoCheckResult]: Loop: 1003#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1002#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1003#L20-7 [2024-11-20 22:20:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2024-11-20 22:20:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203324717] [2024-11-20 22:20:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-20 22:20:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203324717] [2024-11-20 22:20:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203324717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403228873] [2024-11-20 22:20:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:22,220 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:22,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-20 22:20:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:22,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:20:22,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-20 22:20:22,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:20:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-20 22:20:22,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403228873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:20:22,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:20:22,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 22:20:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400265784] [2024-11-20 22:20:22,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:20:22,407 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:22,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2024-11-20 22:20:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:22,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688889199] [2024-11-20 22:20:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:20:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:20:22,459 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:22,592 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-20 22:20:22,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2024-11-20 22:20:22,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:22,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2024-11-20 22:20:22,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-20 22:20:22,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-20 22:20:22,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2024-11-20 22:20:22,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:22,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-20 22:20:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2024-11-20 22:20:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-11-20 22:20:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-20 22:20:22,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-20 22:20:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:20:22,603 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-20 22:20:22,603 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:20:22,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2024-11-20 22:20:22,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:22,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:22,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:22,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:22,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:22,606 INFO L745 eck$LassoCheckResult]: Stem: 1405#$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); 1395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 1396#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1399#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1400#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1407#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1459#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1458#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1457#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1456#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1455#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1454#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1453#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1452#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1451#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1450#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1449#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1448#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1447#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1446#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1445#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1444#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1443#L34-3 assume !(main_~i~1#1 < 10); 1388#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1389#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1402#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1403#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1404#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1442#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1441#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1439#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1437#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1435#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1433#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1431#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1429#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1427#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1425#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1423#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1421#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1419#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1417#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1415#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1412#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1411#L20-3 assume !(sum_~i~0#1 < 10); 1397#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1398#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1393#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1394#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1406#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1440#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1438#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1436#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1434#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1432#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1430#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1428#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1426#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1424#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1422#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1420#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1418#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1416#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1414#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1413#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1410#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1409#L20-7 [2024-11-20 22:20:22,606 INFO L747 eck$LassoCheckResult]: Loop: 1409#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1408#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1409#L20-7 [2024-11-20 22:20:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2024-11-20 22:20:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774349425] [2024-11-20 22:20:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:22,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2024-11-20 22:20:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912495241] [2024-11-20 22:20:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:22,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2024-11-20 22:20:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969878694] [2024-11-20 22:20:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-20 22:20:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969878694] [2024-11-20 22:20:23,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969878694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:23,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260265454] [2024-11-20 22:20:23,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:20:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:23,213 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-20 22:20:23,476 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-20 22:20:23,476 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:20:23,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:20:23,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-20 22:20:23,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 22:20:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260265454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:20:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 22:20:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-11-20 22:20:23,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504516993] [2024-11-20 22:20:23,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:20:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:20:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-11-20 22:20:23,571 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:23,741 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-11-20 22:20:23,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2024-11-20 22:20:23,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:20:23,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2024-11-20 22:20:23,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-20 22:20:23,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-20 22:20:23,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2024-11-20 22:20:23,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:23,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-20 22:20:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2024-11-20 22:20:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 22:20:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-20 22:20:23,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-20 22:20:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 22:20:23,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-20 22:20:23,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:20:23,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2024-11-20 22:20:23,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:20:23,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:23,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:23,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:23,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:23,753 INFO L745 eck$LassoCheckResult]: Stem: 1792#$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); 1782#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#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; 1783#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1786#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1787#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1794#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1830#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1828#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1826#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1825#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1824#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1823#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1821#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1819#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1817#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1815#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1813#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1811#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1809#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1807#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1805#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1802#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1801#L34-3 assume !(main_~i~1#1 < 10); 1777#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1778#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1791#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1789#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1790#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1845#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1844#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1843#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1842#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1841#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1840#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1839#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1838#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1837#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1836#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1835#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1834#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1833#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1832#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1831#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1829#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1827#L20-3 assume !(sum_~i~0#1 < 10); 1784#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1785#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1788#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1793#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1780#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1781#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1822#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1820#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1818#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1816#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1814#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1812#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1810#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1808#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1806#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1804#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1803#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1800#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1799#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1798#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1797#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1796#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1795#L20-8 assume !(sum_~i~0#1 < 10); 1776#L20-9 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1774#sum_returnLabel#2 main_#t~ret8#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1775#L43-3 [2024-11-20 22:20:23,755 INFO L747 eck$LassoCheckResult]: Loop: 1775#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem10#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~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem10#1; 1779#L43-2 main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1775#L43-3 [2024-11-20 22:20:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2024-11-20 22:20:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144988378] [2024-11-20 22:20:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:23,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:24,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:24,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2024-11-20 22:20:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120254597] [2024-11-20 22:20:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:24,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:24,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2024-11-20 22:20:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334558556] [2024-11-20 22:20:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:24,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:24,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:38,209 WARN L286 SmtUtils]: Spent 13.93s on a formula simplification. DAG size of input: 535 DAG size of output: 399 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-20 22:20:44,689 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:44,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:44,690 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:44,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:44,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:44,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:44,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:44,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:44,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2024-11-20 22:20:44,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:44,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:44,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:44,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true