./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 798a7b37 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-?-798a7b3-m [2025-03-04 15:43:38,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:43:38,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:43:38,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:43:38,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:43:38,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:43:38,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:43:38,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:43:38,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:43:38,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:43:38,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:43:38,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:43:38,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:43:38,587 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:43:38,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:43:38,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:43:38,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:43:38,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:43:38,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:43:38,589 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:43:38,589 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-04 15:43:38,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:43:38,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:43:38,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:43:38,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:43:38,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:43:38,819 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-04 15:43:39,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae534674/2c519ac6a0c247a6ac0d8062eec0689a/FLAG05aed6df7 [2025-03-04 15:43:40,137 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:43:40,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2025-03-04 15:43:40,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae534674/2c519ac6a0c247a6ac0d8062eec0689a/FLAG05aed6df7 [2025-03-04 15:43:40,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae534674/2c519ac6a0c247a6ac0d8062eec0689a [2025-03-04 15:43:40,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:43:40,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:43:40,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:40,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:43:40,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:43:40,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e42b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40, skipping insertion in model container [2025-03-04 15:43:40,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:43:40,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:40,605 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:43:40,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:43:40,625 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:43:40,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40 WrapperNode [2025-03-04 15:43:40,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:43:40,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:40,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:43:40,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:43:40,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,652 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-03-04 15:43:40,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:43:40,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:43:40,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:43:40,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:43:40,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,669 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-04 15:43:40,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:43:40,678 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:43:40,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:43:40,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:43:40,678 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (1/1) ... [2025-03-04 15:43:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:40,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:40,706 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-04 15:43:40,708 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-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:43:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:43:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:43:40,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:43:40,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:43:40,934 INFO L1325 $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-04 15:43:40,941 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-04 15:43:40,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:43:40,948 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:43:40,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:43:40,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:40 BoogieIcfgContainer [2025-03-04 15:43:40,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:43:40,950 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:43:40,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:43:40,954 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:43:40,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:40,955 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:43:40" (1/3) ... [2025-03-04 15:43:40,956 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f9c509b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:40, skipping insertion in model container [2025-03-04 15:43:40,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:40,957 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:43:40" (2/3) ... [2025-03-04 15:43:40,957 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f9c509b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:43:40, skipping insertion in model container [2025-03-04 15:43:40,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:43:40,957 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:43:40" (3/3) ... [2025-03-04 15:43:40,958 INFO L363 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2025-03-04 15:43:40,997 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:43:40,998 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:43:40,998 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:43:40,998 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:43:40,998 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:43:40,998 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:43:40,998 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:43:40,998 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:43:41,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:41,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-03-04 15:43:41,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:41,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:41,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:41,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:41,016 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:43:41,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:41,017 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-03-04 15:43:41,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:41,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:41,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:43:41,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:41,021 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-04 15:43:41,021 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-04 15:43:41,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2025-03-04 15:43:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:41,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566247082] [2025-03-04 15:43:41,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:41,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:41,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:41,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 55, now seen corresponding path program 1 times [2025-03-04 15:43:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:41,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229211115] [2025-03-04 15:43:41,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:41,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:41,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:41,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:41,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 55576, now seen corresponding path program 1 times [2025-03-04 15:43:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078623372] [2025-03-04 15:43:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:41,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:41,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:41,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:41,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:41,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:41,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:41,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:41,385 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:41,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:41,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:41,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:41,386 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:41,386 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,386 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:41,386 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:41,386 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2025-03-04 15:43:41,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:41,387 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:41,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:41,742 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:41,745 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:41,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,748 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-04 15:43:41,749 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-04 15:43:41,750 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-04 15:43:41,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,773 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-04 15:43:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,775 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-04 15:43:41,776 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-04 15:43:41,776 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-04 15:43:41,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,799 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-04 15:43:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,801 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-04 15:43:41,802 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-04 15:43:41,803 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-04 15:43:41,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:41,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:41,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,826 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-04 15:43:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,828 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-04 15:43:41,828 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-04 15:43:41,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:41,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:41,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:41,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:43:41,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,854 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-04 15:43:41,855 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-04 15:43:41,856 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-04 15:43:41,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,874 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-04 15:43:41,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,876 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-04 15:43:41,878 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-04 15:43:41,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:41,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:43:41,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,901 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-04 15:43:41,902 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-04 15:43:41,903 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-04 15:43:41,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,924 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-04 15:43:41,926 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-04 15:43:41,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:41,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:41,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,947 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-04 15:43:41,948 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-04 15:43:41,949 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-04 15:43:41,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,971 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-04 15:43:41,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,973 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-04 15:43:41,973 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-04 15:43:41,975 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-04 15:43:41,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:41,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:41,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:41,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:41,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:41,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:41,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:41,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:41,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:41,995 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-04 15:43:41,997 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-04 15:43:41,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-04 15:43:42,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:42,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:42,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:42,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:43:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,020 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:42,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:43:42,025 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-04 15:43:42,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:42,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:42,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:42,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:42,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,045 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:43:42,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:43:42,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:42,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:42,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:42,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:42,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:43:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,065 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-04 15:43:42,066 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-04 15:43:42,066 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-04 15:43:42,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:42,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:42,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:43:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,094 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-04 15:43:42,096 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-04 15:43:42,097 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-04 15:43:42,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:42,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:42,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,118 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-04 15:43:42,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,120 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-04 15:43:42,122 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-04 15:43:42,123 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-04 15:43:42,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:42,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:42,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:42,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,148 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-04 15:43:42,148 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-04 15:43:42,150 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-04 15:43:42,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:42,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:42,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:42,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:42,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:42,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:42,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:42,189 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-04 15:43:42,191 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-04 15:43:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,194 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-04 15:43:42,196 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-04 15:43:42,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:42,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:42,208 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:42,209 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-04 15:43:42,215 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-04 15:43:42,224 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:43:42,231 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:43:42,231 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:43:42,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:43:42,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:43:42,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:42,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:42,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:42,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:42,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:42,282 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-04 15:43:42,303 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-04 15:43:42,304 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-04 15:43:42,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 19 states and 27 transitions. Complement of second has 3 states. [2025-03-04 15:43:42,330 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-04 15:43:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-04 15:43:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-04 15:43:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-04 15:43:42,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:42,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-04 15:43:42,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:42,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:43:42,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:42,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2025-03-04 15:43:42,344 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 17 transitions. [2025-03-04 15:43:42,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:43:42,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:43:42,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2025-03-04 15:43:42,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:42,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2025-03-04 15:43:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2025-03-04 15:43:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-04 15:43:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-03-04 15:43:42,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-04 15:43:42,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-03-04 15:43:42,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:43:42,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-03-04 15:43:42,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:42,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:42,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:43:42,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:42,370 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-04 15:43:42,370 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-04 15:43:42,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 55575, now seen corresponding path program 1 times [2025-03-04 15:43:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625905441] [2025-03-04 15:43:42,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:43:42,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:43:42,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,444 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-04 15:43:42,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:42,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625905441] [2025-03-04 15:43:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625905441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:43:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726425068] [2025-03-04 15:43:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:42,447 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:42,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2025-03-04 15:43:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998150466] [2025-03-04 15:43:42,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:42,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:42,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:42,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:42,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:42,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:42,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:42,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:43:42,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:43:42,496 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 10 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-04 15:43:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:42,502 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-03-04 15:43:42,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-03-04 15:43:42,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:43:42,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:43:42,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:43:42,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:43:42,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:42,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:43:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:43:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:43:42,504 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-04 15:43:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:43:42,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:43:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:43:42,505 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:43:42,505 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:43:42,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-04 15:43:42,505 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:42,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:42,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:43:42,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:42,506 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-04 15:43:42,506 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-04 15:43:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1722879, now seen corresponding path program 1 times [2025-03-04 15:43:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-03-04 15:43:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:43:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:43:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,548 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-04 15:43:42,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-03-04 15:43:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114920474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843967897] [2025-03-04 15:43:42,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:42,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,551 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:42,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:43:42,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:43:42,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:43:42,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:43:42,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:42,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:42,650 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-04 15:43:42,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:42,669 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-04 15:43:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843967897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:42,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 15:43:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780850844] [2025-03-04 15:43:42,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:42,669 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:42,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2025-03-04 15:43:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:42,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265882465] [2025-03-04 15:43:42,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:42,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:42,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:42,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:42,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:42,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:42,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:42,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:42,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:42,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:42,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:42,726 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 9 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:42,744 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-03-04 15:43:42,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-03-04 15:43:42,744 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2025-03-04 15:43:42,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:43:42,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:43:42,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-03-04 15:43:42,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:42,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:43:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-03-04 15:43:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 15:43:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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-04 15:43:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-04 15:43:42,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:43:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:43:42,747 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:43:42,747 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:43:42,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-04 15:43:42,748 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:42,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:42,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:42,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-04 15:43:42,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:42,748 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-04 15:43:42,748 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-04 15:43:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -213265641, now seen corresponding path program 2 times [2025-03-04 15:43:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-03-04 15:43:42,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:42,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-04 15:43:42,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:43:42,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,871 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-04 15:43:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949763939] [2025-03-04 15:43:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949763939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645768954] [2025-03-04 15:43:42,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:42,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:42,875 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:42,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:43:42,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-04 15:43:42,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:43:42,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:42,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:42,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:42,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:42,952 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-04 15:43:42,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:43,017 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-04 15:43:43,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645768954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:43,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:43,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 15:43:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308225816] [2025-03-04 15:43:43,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:43,018 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:43,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 3 times [2025-03-04 15:43:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082202172] [2025-03-04 15:43:43,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:43,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:43,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:43,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:43:43,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:43:43,074 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:43,102 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-03-04 15:43:43,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2025-03-04 15:43:43,103 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:43,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2025-03-04 15:43:43,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:43:43,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:43:43,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2025-03-04 15:43:43,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:43,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-04 15:43:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2025-03-04 15:43:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-04 15:43:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-04 15:43:43,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-04 15:43:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:43:43,105 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-04 15:43:43,105 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:43:43,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2025-03-04 15:43:43,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-03-04 15:43:43,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:43,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:43,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-03-04 15:43:43,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:43,106 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-04 15:43:43,106 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-04 15:43:43,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2068245015, now seen corresponding path program 3 times [2025-03-04 15:43:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75633250] [2025-03-04 15:43:43,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-03-04 15:43:43,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:43:43,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:43:43,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:43:43,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:43:43,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 4 times [2025-03-04 15:43:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864819930] [2025-03-04 15:43:43,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 15:43:43,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:43,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:43,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash -308913953, now seen corresponding path program 1 times [2025-03-04 15:43:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873400932] [2025-03-04 15:43:43,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:43,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:43,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:43:43,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:43:43,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:43,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:46,479 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:43:46,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:43:46,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:43:46,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:43:46,479 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:43:46,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:43:46,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:43:46,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2025-03-04 15:43:46,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:43:46,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:43:46,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:43:46,977 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:43:46,977 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:43:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:46,980 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-04 15:43:46,981 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-04 15:43:46,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:46,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:46,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:43:46,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:46,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:46,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:46,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:43:46,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:43:46,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:46,998 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-04 15:43:46,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:46,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,000 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-04 15:43:47,001 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-04 15:43:47,003 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-04 15:43:47,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:47,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:47,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:47,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:47,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:47,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:47,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:47,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:43:47,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,027 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-04 15:43:47,028 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-04 15:43:47,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:43:47,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:47,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:47,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:47,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:47,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:47,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:47,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:47,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:43:47,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,054 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-04 15:43:47,055 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-04 15:43:47,056 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-04 15:43:47,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:47,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:47,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:47,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:47,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:47,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:47,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:43:47,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:43:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,079 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-04 15:43:47,080 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-04 15:43:47,082 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-04 15:43:47,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:43:47,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:43:47,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:43:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:43:47,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:43:47,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:43:47,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:43:47,120 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:43:47,120 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:43:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:43:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,123 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-04 15:43:47,124 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-04 15:43:47,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:43:47,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:43:47,136 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:43:47,136 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-04 15:43:47,142 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-04 15:43:47,156 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-04 15:43:47,157 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:43:47,157 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:43:47,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:43:47,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:43:47,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,224 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-04 15:43:47,224 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-04 15:43:47,225 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:47,233 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 25 transitions. Complement of second has 3 states. [2025-03-04 15:43:47,234 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-04 15:43:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5 transitions. [2025-03-04 15:43:47,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 1 letters. [2025-03-04 15:43:47,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:47,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2025-03-04 15:43:47,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:47,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 5 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-04 15:43:47,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:43:47,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-03-04 15:43:47,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2025-03-04 15:43:47,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:43:47,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:43:47,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2025-03-04 15:43:47,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-04 15:43:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2025-03-04 15:43:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 15:43:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-04 15:43:47,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-04 15:43:47,237 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-04 15:43:47,237 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:43:47,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-03-04 15:43:47,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:47,238 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-04 15:43:47,238 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-04 15:43:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -986397963, now seen corresponding path program 1 times [2025-03-04 15:43:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369401743] [2025-03-04 15:43:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:43:47,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:43:47,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-04 15:43:47,337 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-04 15:43:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369401743] [2025-03-04 15:43:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369401743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:47,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:43:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728982308] [2025-03-04 15:43:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:47,338 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-03-04 15:43:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780633677] [2025-03-04 15:43:47,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:47,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:43:47,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:43:47,388 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04 15:43:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:47,402 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-03-04 15:43:47,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2025-03-04 15:43:47,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2025-03-04 15:43:47,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:43:47,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:43:47,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2025-03-04 15:43:47,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 15:43:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2025-03-04 15:43:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-03-04 15:43:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-04 15:43:47,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-04 15:43:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:43:47,407 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-04 15:43:47,407 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:43:47,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2025-03-04 15:43:47,407 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:47,408 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-04 15:43:47,408 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-04 15:43:47,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1259362293, now seen corresponding path program 1 times [2025-03-04 15:43:47,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138724276] [2025-03-04 15:43:47,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:43:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:43:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,479 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-04 15:43:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138724276] [2025-03-04 15:43:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138724276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969904499] [2025-03-04 15:43:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:47,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,481 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:47,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 15:43:47,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:43:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:43:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,559 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-04 15:43:47,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:47,574 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-04 15:43:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969904499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:47,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:43:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118709973] [2025-03-04 15:43:47,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:47,577 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:47,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 2 times [2025-03-04 15:43:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871313367] [2025-03-04 15:43:47,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:43:47,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:47,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:43:47,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:43:47,625 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:47,662 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-04 15:43:47,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2025-03-04 15:43:47,663 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2025-03-04 15:43:47,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-04 15:43:47,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 15:43:47,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2025-03-04 15:43:47,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:47,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-04 15:43:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2025-03-04 15:43:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-04 15:43:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 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-04 15:43:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 15:43:47,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 15:43:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:43:47,669 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 15:43:47,669 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:43:47,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2025-03-04 15:43:47,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:47,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:47,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:47,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 15:43:47,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:47,669 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-04 15:43:47,670 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-04 15:43:47,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1643423477, now seen corresponding path program 2 times [2025-03-04 15:43:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219287163] [2025-03-04 15:43:47,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:43:47,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:43:47,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:47,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,802 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-04 15:43:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219287163] [2025-03-04 15:43:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219287163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:43:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807046473] [2025-03-04 15:43:47,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:43:47,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:43:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:43:47,805 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:43:47,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 15:43:47,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:43:47,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:43:47,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:43:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:47,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:43:47,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:43:47,883 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-04 15:43:47,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:43:47,928 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-04 15:43:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807046473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:43:47,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:43:47,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 15:43:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155843381] [2025-03-04 15:43:47,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:43:47,928 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:43:47,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 3 times [2025-03-04 15:43:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444217513] [2025-03-04 15:43:47,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:47,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:43:47,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:47,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:47,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:47,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:47,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:47,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:43:47,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:43:47,971 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-04 15:43:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:48,034 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-03-04 15:43:48,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2025-03-04 15:43:48,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:48,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2025-03-04 15:43:48,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-04 15:43:48,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-04 15:43:48,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2025-03-04 15:43:48,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:48,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-04 15:43:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2025-03-04 15:43:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-03-04 15:43:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:43:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-04 15:43:48,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-04 15:43:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:43:48,042 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-04 15:43:48,042 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:43:48,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2025-03-04 15:43:48,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-03-04 15:43:48,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:48,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:48,043 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 15:43:48,043 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:48,043 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-04 15:43:48,043 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-04 15:43:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1583285003, now seen corresponding path program 3 times [2025-03-04 15:43:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473436434] [2025-03-04 15:43:48,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:43:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-04 15:43:48,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:43:48,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:43:48,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:43:48,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:43:48,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 4 times [2025-03-04 15:43:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904094422] [2025-03-04 15:43:48,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,237 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-04 15:43:48,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:48,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:43:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:48,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:48,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:48,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:48,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1837194819, now seen corresponding path program 4 times [2025-03-04 15:43:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320605724] [2025-03-04 15:43:48,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:43:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:43:48,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 36 statements. [2025-03-04 15:43:48,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:43:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:43:48,512 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-04 15:43:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:43:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320605724] [2025-03-04 15:43:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320605724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:43:48,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:43:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 15:43:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244565661] [2025-03-04 15:43:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:43:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:43:48,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:43:48,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:43:48,545 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-04 15:43:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:43:48,610 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-03-04 15:43:48,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2025-03-04 15:43:48,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:43:48,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 38 states and 39 transitions. [2025-03-04 15:43:48,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-04 15:43:48,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:43:48,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2025-03-04 15:43:48,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:43:48,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-04 15:43:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2025-03-04 15:43:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 15:43:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 states have internal predecessors, (39), 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-04 15:43:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-03-04 15:43:48,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-04 15:43:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:43:48,615 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-04 15:43:48,615 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:43:48,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2025-03-04 15:43:48,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-04 15:43:48,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:43:48,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:43:48,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:43:48,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:43:48,617 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-04 15:43:48,617 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-04 15:43:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1118464557, now seen corresponding path program 1 times [2025-03-04 15:43:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784584971] [2025-03-04 15:43:48,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:43:48,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:43:48,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,695 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:48,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:43:48,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:43:48,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2025-03-04 15:43:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632548894] [2025-03-04 15:43:48,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:48,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:48,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:48,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:43:48,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:43:48,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:43:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:43:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -312662885, now seen corresponding path program 1 times [2025-03-04 15:43:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:43:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103243489] [2025-03-04 15:43:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:43:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:43:48,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:43:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:43:48,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:43:48,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:43:48,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:43:48,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:43:48,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:43:48,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:44:19,450 WARN L286 SmtUtils]: Spent 30.44s on a formula simplification. DAG size of input: 551 DAG size of output: 416 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:44:39,587 WARN L286 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 579 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 15:44:39,599 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:44:39,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:44:39,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:44:39,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:44:39,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:44:39,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:44:39,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:44:39,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:44:39,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration10_Lasso [2025-03-04 15:44:39,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:44:39,600 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:44:39,605 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12