./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/avg10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/avg10-2.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 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:00:07,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:00:07,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:00:07,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:00:07,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:00:07,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:00:07,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:00:07,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:00:07,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:00:07,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:00:07,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:00:07,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:00:07,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:00:07,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:00:07,710 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:00:07,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:00:07,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:00:07,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:00:07,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:00:07,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:00:07,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:00:07,712 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:00:07,712 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 [2025-03-17 20:00:07,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:00:07,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:00:07,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:00:07,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:00:07,949 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:00:07,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/avg10-2.i [2025-03-17 20:00:09,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3847efbb9/b3b4828a7b274752ba144c89b108b3fe/FLAGad735817e [2025-03-17 20:00:09,297 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:00:09,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2025-03-17 20:00:09,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3847efbb9/b3b4828a7b274752ba144c89b108b3fe/FLAGad735817e [2025-03-17 20:00:09,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3847efbb9/b3b4828a7b274752ba144c89b108b3fe [2025-03-17 20:00:09,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:00:09,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:00:09,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:00:09,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:00:09,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:00:09,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09, skipping insertion in model container [2025-03-17 20:00:09,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:00:09,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:00:09,776 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:00:09,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:00:09,799 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:00:09,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09 WrapperNode [2025-03-17 20:00:09,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:00:09,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:00:09,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:00:09,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:00:09,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,823 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-03-17 20:00:09,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:00:09,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:00:09,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:00:09,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:00:09,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,850 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]. [2025-03-17 20:00:09,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:00:09,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:00:09,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:00:09,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:00:09,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (1/1) ... [2025-03-17 20:00:09,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:09,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:09,881 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) [2025-03-17 20:00:09,883 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 [2025-03-17 20:00:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:00:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:00:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:00:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:00:09,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:00:09,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:00:10,083 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-17 20:00:10,095 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 20:00:10,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:00:10,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:00:10,101 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:00:10,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:00:10 BoogieIcfgContainer [2025-03-17 20:00:10,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:00:10,102 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:00:10,102 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:00:10,106 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:00:10,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:00:10,107 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:00:09" (1/3) ... [2025-03-17 20:00:10,108 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c31b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:00:10, skipping insertion in model container [2025-03-17 20:00:10,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:00:10,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:00:09" (2/3) ... [2025-03-17 20:00:10,108 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c31b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:00:10, skipping insertion in model container [2025-03-17 20:00:10,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:00:10,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:00:10" (3/3) ... [2025-03-17 20:00:10,109 INFO L363 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2025-03-17 20:00:10,145 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:00:10,145 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:00:10,145 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:00:10,145 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:00:10,145 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:00:10,145 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:00:10,145 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:00:10,145 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:00:10,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) [2025-03-17 20:00:10,157 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-03-17 20:00:10,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:10,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:10,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:00:10,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:10,161 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:00:10,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) [2025-03-17 20:00:10,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-03-17 20:00:10,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:10,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:10,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:00:10,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:10,165 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" [2025-03-17 20:00:10,165 INFO L754 eck$LassoCheckResult]: Loop: "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-03-17 20:00:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2025-03-17 20:00:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:10,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812595141] [2025-03-17 20:00:10,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:10,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:10,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:10,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:10,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:10,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:10,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-03-17 20:00:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858294282] [2025-03-17 20:00:10,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:10,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:10,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:10,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:10,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:10,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:10,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:10,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 1 times [2025-03-17 20:00:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254504329] [2025-03-17 20:00:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:10,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:00:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:00:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:10,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:00:10,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:00:10,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:10,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:10,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:10,568 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:00:10,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:00:10,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:00:10,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:00:10,569 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:00:10,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:10,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:00:10,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:00:10,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2025-03-17 20:00:10,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:00:10,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:00:10,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:10,956 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:00:10,959 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:00:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:10,962 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) [2025-03-17 20:00:10,964 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 [2025-03-17 20:00:10,965 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 [2025-03-17 20:00:10,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:10,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:10,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:10,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:10,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:10,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:10,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:10,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:10,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:10,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:10,995 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) [2025-03-17 20:00:10,996 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 [2025-03-17 20:00:10,997 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 [2025-03-17 20:00:11,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:11,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:11,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:11,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,014 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 [2025-03-17 20:00:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,016 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) [2025-03-17 20:00:11,018 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 [2025-03-17 20:00:11,019 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 [2025-03-17 20:00:11,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 20:00:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,042 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) [2025-03-17 20:00:11,043 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 [2025-03-17 20:00:11,044 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 [2025-03-17 20:00:11,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,067 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) [2025-03-17 20:00:11,069 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 [2025-03-17 20:00:11,070 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 [2025-03-17 20:00:11,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:11,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:11,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:11,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,089 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) [2025-03-17 20:00:11,090 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 [2025-03-17 20:00:11,092 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 [2025-03-17 20:00:11,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:11,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:11,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:11,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,109 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 [2025-03-17 20:00:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,111 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) [2025-03-17 20:00:11,112 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 [2025-03-17 20:00:11,114 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 [2025-03-17 20:00:11,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,134 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 [2025-03-17 20:00:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,137 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) [2025-03-17 20:00:11,138 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 [2025-03-17 20:00:11,139 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 [2025-03-17 20:00:11,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,160 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 [2025-03-17 20:00:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,163 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) [2025-03-17 20:00:11,164 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 [2025-03-17 20:00:11,166 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 [2025-03-17 20:00:11,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:11,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,189 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) [2025-03-17 20:00:11,191 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 [2025-03-17 20:00:11,192 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 [2025-03-17 20:00:11,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:11,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:11,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:11,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:11,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:11,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:11,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:00:11,231 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:00:11,233 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:00:11,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:11,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,236 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) [2025-03-17 20:00:11,238 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 [2025-03-17 20:00:11,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:00:11,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:00:11,251 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:00:11,252 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = -2*ULTIMATE.start_main_~i~1#1 + 19 Supporting invariants [] [2025-03-17 20:00:11,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 20:00:11,266 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:00:11,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:00:11,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:00:11,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,328 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:00:11,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2025-03-17 20:00:11,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 15 states and 23 transitions. Complement of second has 3 states. [2025-03-17 20:00:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:00:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2025-03-17 20:00:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 20:00:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 20:00:11,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 20:00:11,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 20:00:11,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:11,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2025-03-17 20:00:11,360 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 8 states and 14 transitions. [2025-03-17 20:00:11,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:00:11,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:00:11,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 14 transitions. [2025-03-17 20:00:11,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:11,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 14 transitions. [2025-03-17 20:00:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 14 transitions. [2025-03-17 20:00:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-03-17 20:00:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2025-03-17 20:00:11,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 12 transitions. [2025-03-17 20:00:11,382 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 12 transitions. [2025-03-17 20:00:11,382 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:00:11,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. [2025-03-17 20:00:11,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:11,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:11,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 20:00:11,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:11,383 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" [2025-03-17 20:00:11,383 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1567, now seen corresponding path program 1 times [2025-03-17 20:00:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-03-17 20:00:11,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:00:11,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:00:11,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-03-17 20:00:11,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758210321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:00:11,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:00:11,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 20:00:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162665499] [2025-03-17 20:00:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:00:11,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-03-17 20:00:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948949782] [2025-03-17 20:00:11,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:11,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:11,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:00:11,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:00:11,493 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. cyclomatic complexity: 10 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-03-17 20:00:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:11,501 INFO L93 Difference]: Finished difference Result 7 states and 11 transitions. [2025-03-17 20:00:11,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 11 transitions. [2025-03-17 20:00:11,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 11 transitions. [2025-03-17 20:00:11,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:00:11,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:00:11,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 11 transitions. [2025-03-17 20:00:11,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:11,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 11 transitions. [2025-03-17 20:00:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 11 transitions. [2025-03-17 20:00:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 20:00:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2025-03-17 20:00:11,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 11 transitions. [2025-03-17 20:00:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:00:11,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 11 transitions. [2025-03-17 20:00:11,506 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:00:11,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 11 transitions. [2025-03-17 20:00:11,506 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:11,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:11,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:00:11,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:11,507 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" [2025-03-17 20:00:11,507 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:11,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 48625, now seen corresponding path program 1 times [2025-03-17 20:00:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515887633] [2025-03-17 20:00:11,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:00:11,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:00:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515887633] [2025-03-17 20:00:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515887633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:00:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782285665] [2025-03-17 20:00:11,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:00:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,554 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:00:11,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 20:00:11,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:00:11,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:00:11,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:00:11,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:00:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782285665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:00:11,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:00:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 20:00:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484778562] [2025-03-17 20:00:11,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:00:11,613 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 2 times [2025-03-17 20:00:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-03-17 20:00:11,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:00:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:11,669 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 [2025-03-17 20:00:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:11,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:00:11,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:00:11,683 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. cyclomatic complexity: 9 Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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) [2025-03-17 20:00:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:11,697 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-17 20:00:11,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-17 20:00:11,697 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 20:00:11,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:00:11,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:00:11,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-17 20:00:11,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:11,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:00:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-17 20:00:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 20:00:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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) [2025-03-17 20:00:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-17 20:00:11,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:00:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:00:11,702 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 20:00:11,702 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:00:11,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-17 20:00:11,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:11,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:11,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1] [2025-03-17 20:00:11,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:11,702 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" [2025-03-17 20:00:11,702 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1448635039, now seen corresponding path program 2 times [2025-03-17 20:00:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002990986] [2025-03-17 20:00:11,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 20:00:11,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:00:11,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:00:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002990986] [2025-03-17 20:00:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002990986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:00:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546643341] [2025-03-17 20:00:11,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:00:11,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:11,794 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:00:11,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 20:00:11,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-17 20:00:11,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:00:11,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:00:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:11,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:00:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:00:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546643341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:00:11,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:00:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 20:00:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910957191] [2025-03-17 20:00:11,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:00:11,900 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:11,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 3 times [2025-03-17 20:00:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-03-17 20:00:11,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:00:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:00:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:11,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:11,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:00:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:00:11,943 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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) [2025-03-17 20:00:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:11,959 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2025-03-17 20:00:11,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2025-03-17 20:00:11,960 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2025-03-17 20:00:11,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:00:11,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 20:00:11,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2025-03-17 20:00:11,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:11,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-17 20:00:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2025-03-17 20:00:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 20:00:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-17 20:00:11,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-17 20:00:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:00:11,962 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-17 20:00:11,962 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:00:11,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2025-03-17 20:00:11,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-17 20:00:11,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:11,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:11,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1] [2025-03-17 20:00:11,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:11,963 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" [2025-03-17 20:00:11,963 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:11,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1199355553, now seen corresponding path program 3 times [2025-03-17 20:00:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16997762] [2025-03-17 20:00:11,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:00:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:11,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-03-17 20:00:11,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:00:11,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:00:11,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:11,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:11,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:00:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:00:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:12,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 4 times [2025-03-17 20:00:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972763345] [2025-03-17 20:00:12,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:00:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:12,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:00:12,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:12,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:00:12,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:12,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:12,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:12,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:12,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1474683537, now seen corresponding path program 1 times [2025-03-17 20:00:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815740592] [2025-03-17 20:00:12,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:12,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:00:12,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:00:12,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:12,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:12,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:12,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:00:12,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:00:12,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:12,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:12,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:14,829 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:00:14,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:00:14,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:00:14,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:00:14,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:00:14,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:14,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:00:14,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:00:14,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2025-03-17 20:00:14,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:00:14,829 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:00:14,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:14,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:15,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:15,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:15,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:00:15,346 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:00:15,346 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:00:15,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,348 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) [2025-03-17 20:00:15,350 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 [2025-03-17 20:00:15,351 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 [2025-03-17 20:00:15,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,367 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 [2025-03-17 20:00:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,369 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) [2025-03-17 20:00:15,370 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 [2025-03-17 20:00:15,371 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 [2025-03-17 20:00:15,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,387 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 [2025-03-17 20:00:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,389 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) [2025-03-17 20:00:15,391 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 [2025-03-17 20:00:15,392 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 [2025-03-17 20:00:15,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:00:15,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,410 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) [2025-03-17 20:00:15,411 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 [2025-03-17 20:00:15,412 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 [2025-03-17 20:00:15,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,430 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) [2025-03-17 20:00:15,431 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 [2025-03-17 20:00:15,432 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 [2025-03-17 20:00:15,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,448 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 [2025-03-17 20:00:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,450 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) [2025-03-17 20:00:15,450 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 [2025-03-17 20:00:15,451 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 [2025-03-17 20:00:15,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,467 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 [2025-03-17 20:00:15,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,469 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) [2025-03-17 20:00:15,470 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 [2025-03-17 20:00:15,471 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 [2025-03-17 20:00:15,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,487 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 [2025-03-17 20:00:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,489 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) [2025-03-17 20:00:15,490 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 [2025-03-17 20:00:15,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 [2025-03-17 20:00:15,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 20:00:15,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,508 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) [2025-03-17 20:00:15,509 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 [2025-03-17 20:00:15,510 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 [2025-03-17 20:00:15,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 20:00:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,535 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) [2025-03-17 20:00:15,535 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 [2025-03-17 20:00:15,538 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 [2025-03-17 20:00:15,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,557 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:00:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 20:00:15,560 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 [2025-03-17 20:00:15,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,580 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:00:15,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 20:00:15,583 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 [2025-03-17 20:00:15,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,603 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) [2025-03-17 20:00:15,604 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 [2025-03-17 20:00:15,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 [2025-03-17 20:00:15,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,623 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 [2025-03-17 20:00:15,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,625 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) [2025-03-17 20:00:15,625 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 [2025-03-17 20:00:15,626 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 [2025-03-17 20:00:15,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 20:00:15,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,647 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) [2025-03-17 20:00:15,648 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 [2025-03-17 20:00:15,650 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 [2025-03-17 20:00:15,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,665 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 [2025-03-17 20:00:15,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,668 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) [2025-03-17 20:00:15,668 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 [2025-03-17 20:00:15,669 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 [2025-03-17 20:00:15,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-17 20:00:15,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,688 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) [2025-03-17 20:00:15,689 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 [2025-03-17 20:00:15,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:00:15,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:00:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,711 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) [2025-03-17 20:00:15,713 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 [2025-03-17 20:00:15,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:00:15,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,734 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) [2025-03-17 20:00:15,736 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 [2025-03-17 20:00:15,737 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 [2025-03-17 20:00:15,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:00:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,757 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) [2025-03-17 20:00:15,758 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 [2025-03-17 20:00:15,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 [2025-03-17 20:00:15,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:00:15,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:00:15,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:00:15,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:00:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,777 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) [2025-03-17 20:00:15,778 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 [2025-03-17 20:00:15,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:00:15,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:00:15,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,800 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) [2025-03-17 20:00:15,801 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 [2025-03-17 20:00:15,802 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 [2025-03-17 20:00:15,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,821 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 [2025-03-17 20:00:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,822 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) [2025-03-17 20:00:15,823 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 [2025-03-17 20:00:15,824 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 [2025-03-17 20:00:15,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:00:15,842 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 [2025-03-17 20:00:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,843 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) [2025-03-17 20:00:15,844 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 [2025-03-17 20:00:15,845 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 [2025-03-17 20:00:15,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:00:15,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:00:15,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:00:15,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:00:15,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:00:15,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:00:15,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:00:15,881 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 20:00:15,881 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-17 20:00:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:00:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:15,884 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) [2025-03-17 20:00:15,885 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 [2025-03-17 20:00:15,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:00:15,896 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:00:15,896 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:00:15,896 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_avg_~x#1.base)_1, ULTIMATE.start_avg_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_avg_~x#1.base)_1 - 8*ULTIMATE.start_avg_~i~0#1 Supporting invariants [] [2025-03-17 20:00:15,902 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 [2025-03-17 20:00:15,927 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 20:00:15,929 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:00:15,930 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:00:15,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 20:00:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:15,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:00:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:00:15,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:15,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:15,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:00:15,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:15,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:15,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:15,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:15,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:00:15,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:00:15,979 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:00:15,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:15,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 3 states. [2025-03-17 20:00:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:00:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2025-03-17 20:00:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 12 letters. Loop has 1 letters. [2025-03-17 20:00:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-17 20:00:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-17 20:00:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:00:15,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-17 20:00:15,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:15,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-03-17 20:00:15,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 20:00:15,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 20:00:15,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-17 20:00:15,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:15,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-17 20:00:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-17 20:00:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-17 20:00:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-17 20:00:15,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 20:00:15,993 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 20:00:15,993 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:00:15,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-03-17 20:00:15,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:15,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:15,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:15,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-03-17 20:00:15,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:15,995 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" [2025-03-17 20:00:15,995 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:15,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1474683536, now seen corresponding path program 1 times [2025-03-17 20:00:15,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568105682] [2025-03-17 20:00:15,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:00:16,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:00:16,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 20:00:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568105682] [2025-03-17 20:00:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568105682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:00:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:00:16,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:00:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319912510] [2025-03-17 20:00:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:00:16,060 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-17 20:00:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786601330] [2025-03-17 20:00:16,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:16,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:00:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:00:16,096 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 10 Second operand has 3 states, 2 states have (on average 2.0) 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) [2025-03-17 20:00:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:16,107 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-03-17 20:00:16,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2025-03-17 20:00:16,107 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2025-03-17 20:00:16,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 20:00:16,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 20:00:16,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2025-03-17 20:00:16,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:16,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-17 20:00:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2025-03-17 20:00:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-17 20:00:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-17 20:00:16,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-17 20:00:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:00:16,110 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-17 20:00:16,110 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:00:16,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2025-03-17 20:00:16,110 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:16,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:16,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-03-17 20:00:16,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:16,111 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,111 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -168328144, now seen corresponding path program 1 times [2025-03-17 20:00:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-17 20:00:16,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:00:16,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:00:16,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 20:00:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-17 20:00:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832597719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:00:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951160442] [2025-03-17 20:00:16,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:16,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:00:16,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:16,174 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:00:16,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-17 20:00:16,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:00:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:00:16,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:16,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:00:16,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 20:00:16,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:00:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 20:00:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951160442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:00:16,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:00:16,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 20:00:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286191650] [2025-03-17 20:00:16,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:00:16,253 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 2 times [2025-03-17 20:00:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263819050] [2025-03-17 20:00:16,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:00:16,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:16,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:00:16,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:00:16,292 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:16,329 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-17 20:00:16,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2025-03-17 20:00:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2025-03-17 20:00:16,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-17 20:00:16,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-17 20:00:16,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2025-03-17 20:00:16,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:16,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 20:00:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2025-03-17 20:00:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-03-17 20:00:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 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) [2025-03-17 20:00:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-17 20:00:16,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-17 20:00:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:00:16,334 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-17 20:00:16,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:00:16,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2025-03-17 20:00:16,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:16,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:16,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 1, 1, 1] [2025-03-17 20:00:16,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:16,335 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,335 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash -263929456, now seen corresponding path program 2 times [2025-03-17 20:00:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367659588] [2025-03-17 20:00:16,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 20:00:16,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:00:16,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:00:16,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 20:00:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367659588] [2025-03-17 20:00:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367659588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:00:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107915362] [2025-03-17 20:00:16,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:00:16,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:00:16,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:00:16,454 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:00:16,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-17 20:00:16,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 20:00:16,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 20:00:16,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:00:16,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:16,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:00:16,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:00:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 20:00:16,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:00:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 20:00:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107915362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:00:16,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:00:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 20:00:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878535814] [2025-03-17 20:00:16,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:00:16,587 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:00:16,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 3 times [2025-03-17 20:00:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-17 20:00:16,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:00:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:00:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:16,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:16,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:00:16,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:00:16,625 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:16,685 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-17 20:00:16,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2025-03-17 20:00:16,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2025-03-17 20:00:16,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:00:16,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:00:16,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2025-03-17 20:00:16,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:16,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-03-17 20:00:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2025-03-17 20:00:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2025-03-17 20:00:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-17 20:00:16,690 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-17 20:00:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 20:00:16,692 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-17 20:00:16,692 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:00:16,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2025-03-17 20:00:16,692 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-17 20:00:16,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:16,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:16,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1] [2025-03-17 20:00:16,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:16,693 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,694 INFO L754 eck$LassoCheckResult]: Loop: "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" [2025-03-17 20:00:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1543467024, now seen corresponding path program 3 times [2025-03-17 20:00:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183982463] [2025-03-17 20:00:16,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:00:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-03-17 20:00:16,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:00:16,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 20:00:16,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:16,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 20:00:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 20:00:16,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:16,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 4 times [2025-03-17 20:00:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487983037] [2025-03-17 20:00:16,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:00:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 20:00:16,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:00:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:16,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:16,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:16,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 602837502, now seen corresponding path program 4 times [2025-03-17 20:00:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-03-17 20:00:16,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:00:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:16,904 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 20:00:16,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:00:16,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:00:16,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:00:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-17 20:00:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:00:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-03-17 20:00:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329897696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:00:17,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:00:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 20:00:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860479042] [2025-03-17 20:00:17,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:00:17,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:00:17,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:00:17,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:00:17,189 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:00:17,259 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2025-03-17 20:00:17,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2025-03-17 20:00:17,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:00:17,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 36 transitions. [2025-03-17 20:00:17,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:00:17,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:00:17,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2025-03-17 20:00:17,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:00:17,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-17 20:00:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2025-03-17 20:00:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 20:00:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:00:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-17 20:00:17,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-17 20:00:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 20:00:17,264 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-17 20:00:17,264 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:00:17,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2025-03-17 20:00:17,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 20:00:17,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:00:17,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:00:17,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2025-03-17 20:00:17,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:00:17,266 INFO L752 eck$LassoCheckResult]: Stem: "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);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;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume avg_~i~0#1 < 10;call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1;" "assume !(avg_~i~0#1 < 10);avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296);main_#t~ret8#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } 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;" [2025-03-17 20:00:17,267 INFO L754 eck$LassoCheckResult]: Loop: "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;main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-17 20:00:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 602837501, now seen corresponding path program 1 times [2025-03-17 20:00:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316018970] [2025-03-17 20:00:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:17,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:00:17,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:00:17,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:17,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:00:17,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:00:17,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2025-03-17 20:00:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085668238] [2025-03-17 20:00:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:17,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:17,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:00:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:00:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:00:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:00:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1508093359, now seen corresponding path program 1 times [2025-03-17 20:00:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:00:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972576939] [2025-03-17 20:00:17,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:00:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:00:17,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 20:00:17,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:00:17,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:00:17,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 20:00:17,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:00:17,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:00:17,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:00:17,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:01:00,292 WARN L286 SmtUtils]: Spent 42.55s on a formula simplification. DAG size of input: 549 DAG size of output: 413 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:01:28,954 WARN L286 SmtUtils]: Spent 25.40s on a formula simplification that was a NOOP. DAG size: 764 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:01:28,965 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:01:28,965 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:01:28,965 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:01:28,965 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:01:28,965 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:01:28,965 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:01:28,965 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:01:28,965 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:01:28,965 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration10_Lasso [2025-03-17 20:01:28,965 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:01:28,965 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:01:28,971 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-03-17 20:01:29,151 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 63504 disjunctions. This might take some time...