./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:43:51,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:43:52,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:43:52,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:43:52,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:43:52,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:43:52,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:43:52,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:43:52,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:43:52,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:43:52,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:43:52,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:43:52,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:43:52,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:43:52,050 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:43:52,050 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:43:52,050 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:43:52,051 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:43:52,051 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:43:52,051 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:43:52,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:43:52,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:43:52,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:43:52,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:43:52,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:43:52,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:43:52,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:43:52,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:43:52,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:43:52,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:43:52,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:43:52,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:43:52,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:43:52,056 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:43:52,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:43:52,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:43:52,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:43:52,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:43:52,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:43:52,058 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:43:52,059 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 [2024-11-10 22:43:52,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:43:52,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:43:52,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:43:52,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:43:52,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:43:52,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-11-10 22:43:53,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:43:54,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:43:54,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-11-10 22:43:54,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9510f566/1b4939c77cd24fa2a72a42127d1ffb58/FLAG634ca2dd1 [2024-11-10 22:43:54,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9510f566/1b4939c77cd24fa2a72a42127d1ffb58 [2024-11-10 22:43:54,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:43:54,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:43:54,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:43:54,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:43:54,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:43:54,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398763de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54, skipping insertion in model container [2024-11-10 22:43:54,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:43:54,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:43:54,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:43:54,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:43:54,616 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:43:54,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54 WrapperNode [2024-11-10 22:43:54,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:43:54,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:43:54,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:43:54,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:43:54,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,656 INFO L138 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-10 22:43:54,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:43:54,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:43:54,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:43:54,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:43:54,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,692 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 22:43:54,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:43:54,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:43:54,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:43:54,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:43:54,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (1/1) ... [2024-11-10 22:43:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:54,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:54,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:43:54,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:43:54,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:43:54,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:43:54,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:43:54,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:43:54,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:43:54,911 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:43:54,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:43:55,052 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2024-11-10 22:43:55,093 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 22:43:55,094 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:43:55,108 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:43:55,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:43:55,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:43:55 BoogieIcfgContainer [2024-11-10 22:43:55,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:43:55,112 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:43:55,114 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:43:55,119 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:43:55,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:43:55,120 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:43:54" (1/3) ... [2024-11-10 22:43:55,121 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5754edef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:43:55, skipping insertion in model container [2024-11-10 22:43:55,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:43:55,122 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:43:54" (2/3) ... [2024-11-10 22:43:55,123 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5754edef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:43:55, skipping insertion in model container [2024-11-10 22:43:55,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:43:55,123 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:43:55" (3/3) ... [2024-11-10 22:43:55,124 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2024-11-10 22:43:55,203 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:43:55,203 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:43:55,204 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:43:55,204 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:43:55,204 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:43:55,205 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:43:55,205 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:43:55,205 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:43:55,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:55,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 22:43:55,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:55,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:55,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:43:55,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:43:55,234 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:43:55,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:55,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 22:43:55,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:55,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:55,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:43:55,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:43:55,242 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 16#L516true assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 7#L517-1true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 17#L518-1true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 19#L519true [2024-11-10 22:43:55,243 INFO L747 eck$LassoCheckResult]: Loop: 19#L519true assume true; 18#L519-1true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9#L521true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 10#L524true call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 19#L519true [2024-11-10 22:43:55,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash 61042718, now seen corresponding path program 1 times [2024-11-10 22:43:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:55,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191136822] [2024-11-10 22:43:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1630399, now seen corresponding path program 1 times [2024-11-10 22:43:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800441337] [2024-11-10 22:43:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1508050340, now seen corresponding path program 1 times [2024-11-10 22:43:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851898500] [2024-11-10 22:43:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:55,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:55,832 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:43:55,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:43:55,833 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:43:55,833 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:43:55,833 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:43:55,833 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:55,833 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:43:55,833 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:43:55,833 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2024-11-10 22:43:55,833 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:43:55,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:43:55,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:55,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:55,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:56,298 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:43:56,303 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:43:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:56,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:56,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:43:56,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:56,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:56,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:56,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:56,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:56,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:56,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:56,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:56,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:56,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:43:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:56,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:56,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:56,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:43:56,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:56,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:56,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:56,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:56,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:56,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:56,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:56,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:56,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:43:56,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:56,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:56,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:56,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:43:56,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:56,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:56,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:56,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:56,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:56,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:56,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:56,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:56,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:43:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:56,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:56,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:43:56,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:56,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:56,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:56,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:56,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:56,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:56,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:56,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:43:56,478 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-10 22:43:56,478 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-10 22:43:56,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:56,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:56,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:43:56,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:43:56,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:43:56,515 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:43:56,516 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:43:56,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 22:43:56,541 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-11-10 22:43:56,549 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:43:56,550 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:43:56,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-10 22:43:56,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:56,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:43:56,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:56,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:43:56,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:56,731 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2024-11-10 22:43:56,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:56,797 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Result 36 states and 49 transitions. Complement of second has 7 states. [2024-11-10 22:43:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:43:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2024-11-10 22:43:56,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-10 22:43:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:56,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-10 22:43:56,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:56,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-10 22:43:56,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:56,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2024-11-10 22:43:56,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:56,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 17 states and 23 transitions. [2024-11-10 22:43:56,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:43:56,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 22:43:56,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2024-11-10 22:43:56,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:43:56,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-10 22:43:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2024-11-10 22:43:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 22:43:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) 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) [2024-11-10 22:43:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-10 22:43:56,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-10 22:43:56,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-10 22:43:56,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:43:56,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-11-10 22:43:56,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:56,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:56,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:56,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:43:56,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:43:56,855 INFO L745 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 127#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 137#L516 assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 132#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 133#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 138#L519 assume true; 139#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 130#L526-3 main_~j~0#1 := 0; 131#L526 [2024-11-10 22:43:56,855 INFO L747 eck$LassoCheckResult]: Loop: 131#L526 assume true; 124#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 125#L527 assume !true; 129#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 131#L526 [2024-11-10 22:43:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1752468468, now seen corresponding path program 1 times [2024-11-10 22:43:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621141660] [2024-11-10 22:43:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:43:56,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621141660] [2024-11-10 22:43:56,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621141660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:43:56,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:43:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:43:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636864682] [2024-11-10 22:43:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:43:56,994 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:43:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1322650, now seen corresponding path program 1 times [2024-11-10 22:43:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704501525] [2024-11-10 22:43:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:43:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704501525] [2024-11-10 22:43:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704501525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:43:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:43:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:43:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588136960] [2024-11-10 22:43:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:43:57,005 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:43:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:43:57,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:43:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:43:57,009 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:43:57,015 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-10 22:43:57,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-11-10 22:43:57,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:57,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:43:57,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:43:57,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 22:43:57,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-11-10 22:43:57,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:43:57,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:43:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-11-10 22:43:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 22:43:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:43:57,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:43:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:43:57,021 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:43:57,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:43:57,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-11-10 22:43:57,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:57,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:57,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:57,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:43:57,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:43:57,023 INFO L745 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 170#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 178#L516 assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 173#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 174#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 179#L519 assume true; 180#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 171#L526-3 main_~j~0#1 := 0; 172#L526 [2024-11-10 22:43:57,023 INFO L747 eck$LassoCheckResult]: Loop: 172#L526 assume true; 165#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 166#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 167#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 168#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 172#L526 [2024-11-10 22:43:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1752468468, now seen corresponding path program 2 times [2024-11-10 22:43:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951164642] [2024-11-10 22:43:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:43:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951164642] [2024-11-10 22:43:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951164642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:43:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:43:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:43:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916690131] [2024-11-10 22:43:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:43:57,111 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:43:57,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 41001255, now seen corresponding path program 1 times [2024-11-10 22:43:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895109764] [2024-11-10 22:43:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:43:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:43:57,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:43:57,191 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:43:57,214 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 22:43:57,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2024-11-10 22:43:57,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:57,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2024-11-10 22:43:57,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:43:57,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 22:43:57,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2024-11-10 22:43:57,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:43:57,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-10 22:43:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2024-11-10 22:43:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-10 22:43:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-10 22:43:57,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:43:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:43:57,222 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:43:57,222 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:43:57,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-10 22:43:57,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-10 22:43:57,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:57,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:57,223 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:43:57,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:43:57,224 INFO L745 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 215#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 223#L516 assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 218#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 219#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 224#L519 assume true; 226#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 220#L521 assume !(main_~val~0#1 < 0); 221#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 222#L519 assume true; 225#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 216#L526-3 main_~j~0#1 := 0; 217#L526 [2024-11-10 22:43:57,224 INFO L747 eck$LassoCheckResult]: Loop: 217#L526 assume true; 210#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 211#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 212#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 213#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 217#L526 [2024-11-10 22:43:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash -968816521, now seen corresponding path program 1 times [2024-11-10 22:43:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032680863] [2024-11-10 22:43:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:57,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 41001255, now seen corresponding path program 2 times [2024-11-10 22:43:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702784714] [2024-11-10 22:43:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1827762801, now seen corresponding path program 1 times [2024-11-10 22:43:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548455579] [2024-11-10 22:43:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:57,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:57,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:43:57,627 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:43:57,628 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:43:57,628 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:43:57,628 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:43:57,628 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:43:57,628 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:57,629 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:43:57,629 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:43:57,629 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2024-11-10 22:43:57,629 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:43:57,629 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:43:57,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:57,993 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:43:57,993 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:43:57,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:57,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:57,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:57,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:43:58,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:43:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:43:58,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:43:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:43:58,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:43:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:43:58,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,139 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 [2024-11-10 22:43:58,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,141 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:43:58,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 22:43:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:43:58,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:58,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:58,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,201 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 [2024-11-10 22:43:58,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:43:58,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:43:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:43:58,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:58,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:58,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,276 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 [2024-11-10 22:43:58,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:43:58,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:43:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,316 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:43:58,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:43:58,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,353 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:43:58,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 22:43:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,392 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:43:58,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,425 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 [2024-11-10 22:43:58,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:43:58,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:58,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:58,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:58,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 22:43:58,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,454 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:43:58,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:58,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:58,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:58,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 22:43:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,486 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:43:58,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:58,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:58,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:58,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:58,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:58,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:58,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:58,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:43:58,542 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:43:58,542 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-10 22:43:58,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:58,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:58,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:58,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:43:58,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:43:58,563 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-10 22:43:58,563 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:43:58,563 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 1 Supporting invariants [-1*ULTIMATE.start_main_~length~0#1 + 1 >= 0] [2024-11-10 22:43:58,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-10 22:43:58,590 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-10 22:43:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:58,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:43:58,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:58,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:43:58,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:58,787 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:43:58,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:58,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 47 transitions. Complement of second has 9 states. [2024-11-10 22:43:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:43:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2024-11-10 22:43:58,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 12 letters. Loop has 5 letters. [2024-11-10 22:43:58,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:58,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 17 letters. Loop has 5 letters. [2024-11-10 22:43:58,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:58,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 12 letters. Loop has 10 letters. [2024-11-10 22:43:58,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:58,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2024-11-10 22:43:58,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:43:58,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 46 transitions. [2024-11-10 22:43:58,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-10 22:43:58,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-10 22:43:58,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-11-10 22:43:58,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:43:58,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-10 22:43:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-11-10 22:43:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-10 22:43:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-10 22:43:58,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-10 22:43:58,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-10 22:43:58,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:43:58,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2024-11-10 22:43:58,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 22:43:58,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:58,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:58,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:43:58,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:43:58,857 INFO L745 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 374#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 384#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 377#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 378#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 390#L519 assume true; 388#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 389#L521 assume !(main_~val~0#1 < 0); 396#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 395#L519 assume true; 387#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 375#L526-3 main_~j~0#1 := 0; 376#L526 [2024-11-10 22:43:58,858 INFO L747 eck$LassoCheckResult]: Loop: 376#L526 assume true; 382#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 399#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 398#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 385#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 376#L526 [2024-11-10 22:43:58,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1165330026, now seen corresponding path program 1 times [2024-11-10 22:43:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739731016] [2024-11-10 22:43:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:58,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash 41001255, now seen corresponding path program 3 times [2024-11-10 22:43:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789391586] [2024-11-10 22:43:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash -959652686, now seen corresponding path program 1 times [2024-11-10 22:43:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343465118] [2024-11-10 22:43:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:58,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:59,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-10 22:43:59,178 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:43:59,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:43:59,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:43:59,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:43:59,178 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:43:59,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:59,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:43:59,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:43:59,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration5_Lasso [2024-11-10 22:43:59,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:43:59,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:43:59,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:43:59,490 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:43:59,490 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:43:59,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:59,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:59,492 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:59,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 22:43:59,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:59,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:59,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:59,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:59,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:59,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:59,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:59,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:59,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:59,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-10 22:43:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:59,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:59,527 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:43:59,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 22:43:59,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:59,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:59,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:43:59,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:59,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:59,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:59,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:43:59,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:43:59,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:43:59,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-10 22:43:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:59,561 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) [2024-11-10 22:43:59,565 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 [2024-11-10 22:43:59,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:43:59,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:43:59,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:43:59,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:43:59,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:43:59,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:43:59,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:43:59,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:43:59,621 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:43:59,621 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-10 22:43:59,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:43:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:43:59,623 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) [2024-11-10 22:43:59,625 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 [2024-11-10 22:43:59,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:43:59,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:43:59,639 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:43:59,639 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-10 22:43:59,657 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 [2024-11-10 22:43:59,667 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-10 22:43:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:59,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:43:59,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:43:59,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:43:59,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:43:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:43:59,752 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:43:59,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:59,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 44 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 62 transitions. Complement of second has 6 states. [2024-11-10 22:43:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:43:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2024-11-10 22:43:59,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 12 letters. Loop has 5 letters. [2024-11-10 22:43:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:59,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 5 letters. [2024-11-10 22:43:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:59,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 12 letters. Loop has 10 letters. [2024-11-10 22:43:59,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:43:59,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2024-11-10 22:43:59,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-10 22:43:59,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 39 states and 50 transitions. [2024-11-10 22:43:59,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-10 22:43:59,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-10 22:43:59,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2024-11-10 22:43:59,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:43:59,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-11-10 22:43:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2024-11-10 22:43:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. [2024-11-10 22:43:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:43:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-10 22:43:59,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-10 22:43:59,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-10 22:43:59,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:43:59,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-10 22:43:59,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:43:59,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:43:59,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:43:59,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:43:59,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:43:59,793 INFO L745 eck$LassoCheckResult]: Stem: 540#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 541#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 550#L516 assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 544#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 545#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 551#L519 assume true; 553#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 546#L521 assume !(main_~val~0#1 < 0); 547#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 548#L519 assume true; 552#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 542#L526-3 main_~j~0#1 := 0; 543#L526 assume true; 533#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 534#L527 [2024-11-10 22:43:59,794 INFO L747 eck$LassoCheckResult]: Loop: 534#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 537#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 534#L527 [2024-11-10 22:43:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash 975226966, now seen corresponding path program 1 times [2024-11-10 22:43:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606736942] [2024-11-10 22:43:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:59,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2024-11-10 22:43:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:59,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269824454] [2024-11-10 22:43:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:59,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:43:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:43:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 890244085, now seen corresponding path program 1 times [2024-11-10 22:43:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:43:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523497058] [2024-11-10 22:43:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:43:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:43:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:43:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:43:59,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:00,076 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:00,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:00,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:00,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:00,077 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:00,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:00,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:00,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration6_Lasso [2024-11-10 22:44:00,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:00,077 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:00,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:00,418 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:00,421 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:00,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,423 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:44:00,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,457 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 22:44:00,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-10 22:44:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,493 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 22:44:00,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-10 22:44:00,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,528 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 22:44:00,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-10 22:44:00,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,566 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 22:44:00,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-10 22:44:00,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-10 22:44:00,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,598 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 22:44:00,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,624 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 22:44:00,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,650 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 22:44:00,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,686 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 22:44:00,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,725 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 22:44:00,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,761 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 22:44:00,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,797 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 22:44:00,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:00,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:00,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:00,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-10 22:44:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,831 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 22:44:00,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-10 22:44:00,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,876 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 22:44:00,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 [2024-11-10 22:44:00,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-10 22:44:00,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,916 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 22:44:00,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:00,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,951 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-10 22:44:00,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:00,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:00,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:00,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:00,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:00,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:00,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:00,976 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:00,991 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-10 22:44:00,991 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-10 22:44:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:00,993 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:00,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-10 22:44:00,996 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:01,010 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:01,010 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:01,010 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) ULTIMATE.start_main_~arr~0#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) ULTIMATE.start_main_~arr~0#1.offset)_1 Supporting invariants [] [2024-11-10 22:44:01,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:01,037 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-10 22:44:01,039 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:01,039 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:01,039 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:01,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:44:01,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:01,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:01,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:01,133 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:44:01,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:01,177 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Result 32 states and 40 transitions. Complement of second has 8 states. [2024-11-10 22:44:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-10 22:44:01,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-10 22:44:01,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:01,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2024-11-10 22:44:01,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:01,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-10 22:44:01,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:01,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2024-11-10 22:44:01,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2024-11-10 22:44:01,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:01,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:01,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2024-11-10 22:44:01,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:01,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-10 22:44:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2024-11-10 22:44:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-10 22:44:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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) [2024-11-10 22:44:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-10 22:44:01,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-10 22:44:01,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-10 22:44:01,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:44:01,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-11-10 22:44:01,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:01,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:01,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:01,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:01,184 INFO L745 eck$LassoCheckResult]: Stem: 687#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 688#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 700#L516 assume main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911;main_~length~0#1 := 1; 691#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 692#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 703#L519 assume true; 702#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 693#L521 assume !(main_~val~0#1 < 0); 694#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 695#L519 assume true; 701#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 689#L526-3 main_~j~0#1 := 0; 690#L526 assume true; 682#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 683#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 685#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 686#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 698#L526 assume true; 680#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 681#L527 [2024-11-10 22:44:01,184 INFO L747 eck$LassoCheckResult]: Loop: 681#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 684#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 681#L527 [2024-11-10 22:44:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -161571888, now seen corresponding path program 2 times [2024-11-10 22:44:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421524439] [2024-11-10 22:44:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:44:01,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421524439] [2024-11-10 22:44:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421524439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985190785] [2024-11-10 22:44:01,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:44:01,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:01,265 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:01,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-10 22:44:01,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:44:01,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:01,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:44:01,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:44:01,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 22:44:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985190785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:44:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 22:44:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 22:44:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839908245] [2024-11-10 22:44:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:44:01,363 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:01,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2024-11-10 22:44:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369911984] [2024-11-10 22:44:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:01,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:44:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:44:01,406 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2024-11-10 22:44:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:01,430 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-10 22:44:01,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2024-11-10 22:44:01,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 25 states and 30 transitions. [2024-11-10 22:44:01,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:01,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:01,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2024-11-10 22:44:01,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:01,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-10 22:44:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2024-11-10 22:44:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-10 22:44:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-10 22:44:01,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-10 22:44:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:44:01,435 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-10 22:44:01,435 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:44:01,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-11-10 22:44:01,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:01,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:01,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:01,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:01,437 INFO L745 eck$LassoCheckResult]: Stem: 816#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 817#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 831#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 823#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 824#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 833#L519 assume true; 835#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 825#L521 assume !(main_~val~0#1 < 0); 826#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 827#L519 assume true; 834#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 821#L526-3 main_~j~0#1 := 0; 822#L526 assume true; 829#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 820#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 836#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 832#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 830#L526 assume true; 812#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 813#L527 [2024-11-10 22:44:01,437 INFO L747 eck$LassoCheckResult]: Loop: 813#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 818#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 813#L527 [2024-11-10 22:44:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1191737809, now seen corresponding path program 2 times [2024-11-10 22:44:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112246704] [2024-11-10 22:44:01,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112246704] [2024-11-10 22:44:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112246704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204718472] [2024-11-10 22:44:01,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:44:01,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:01,505 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:01,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-10 22:44:01,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:44:01,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:01,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:44:01,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:01,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204718472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:01,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:01,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-10 22:44:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801686798] [2024-11-10 22:44:01,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:01,683 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:01,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2024-11-10 22:44:01,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350222410] [2024-11-10 22:44:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 22:44:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 22:44:01,730 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:01,790 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-10 22:44:01,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2024-11-10 22:44:01,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 32 states and 39 transitions. [2024-11-10 22:44:01,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:01,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:01,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2024-11-10 22:44:01,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:01,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-10 22:44:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2024-11-10 22:44:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-10 22:44:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-10 22:44:01,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-10 22:44:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 22:44:01,797 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-10 22:44:01,797 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:44:01,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-10 22:44:01,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:01,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:01,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:01,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:01,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:01,799 INFO L745 eck$LassoCheckResult]: Stem: 1009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1010#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1021#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1013#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1014#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1023#L519 assume true; 1026#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1030#L521 assume !(main_~val~0#1 < 0); 1028#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1027#L519 assume true; 1025#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1015#L521 assume !(main_~val~0#1 < 0); 1016#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1017#L519 assume true; 1024#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 1011#L526-3 main_~j~0#1 := 0; 1012#L526 assume true; 1019#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1008#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1029#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1022#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1020#L526 assume true; 1002#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1003#L527 [2024-11-10 22:44:01,799 INFO L747 eck$LassoCheckResult]: Loop: 1003#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1006#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1003#L527 [2024-11-10 22:44:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1236088046, now seen corresponding path program 3 times [2024-11-10 22:44:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710112646] [2024-11-10 22:44:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2024-11-10 22:44:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275245048] [2024-11-10 22:44:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:01,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1825328499, now seen corresponding path program 1 times [2024-11-10 22:44:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:01,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461222535] [2024-11-10 22:44:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:01,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:01,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:02,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,198 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:02,198 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:02,198 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:02,198 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:02,198 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:02,198 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:02,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:02,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration9_Lasso [2024-11-10 22:44:02,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:02,198 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:02,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:02,556 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:02,556 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,560 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-10 22:44:02,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,592 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-10 22:44:02,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,605 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-10 22:44:02,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,617 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-10 22:44:02,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,641 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-10 22:44:02,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-10 22:44:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,669 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-10 22:44:02,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-10 22:44:02,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,694 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-10 22:44:02,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:02,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:02,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,727 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-10 22:44:02,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,754 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-10 22:44:02,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:02,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:02,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,780 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-10 22:44:02,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:02,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:02,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-10 22:44:02,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,806 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-10 22:44:02,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-10 22:44:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,830 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-10 22:44:02,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:02,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:02,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:02,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-10 22:44:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,854 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-10 22:44:02,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:02,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:02,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:02,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,887 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-10 22:44:02,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:02,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:02,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:02,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:02,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:02,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:02,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:02,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:02,916 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-10 22:44:02,916 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:02,917 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:02,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-10 22:44:02,918 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:02,929 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:02,929 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:02,929 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-11-10 22:44:02,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:02,953 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:44:02,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:02,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:02,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:02,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:02,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,130 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:03,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 5 states. [2024-11-10 22:44:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-10 22:44:03,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 22:44:03,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:03,159 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,330 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:03,330 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:03,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 5 states. [2024-11-10 22:44:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-10 22:44:03,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 22:44:03,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:03,393 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:03,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,562 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:03,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,632 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 56 transitions. Complement of second has 11 states. [2024-11-10 22:44:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2024-11-10 22:44:03,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 22:44:03,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:03,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-10 22:44:03,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:03,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 23 letters. Loop has 4 letters. [2024-11-10 22:44:03,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:03,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2024-11-10 22:44:03,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:03,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 48 transitions. [2024-11-10 22:44:03,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:03,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:03,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2024-11-10 22:44:03,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:03,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-10 22:44:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2024-11-10 22:44:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-10 22:44:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-10 22:44:03,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-10 22:44:03,638 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-10 22:44:03,638 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:44:03,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2024-11-10 22:44:03,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:03,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:03,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:03,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:03,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:03,640 INFO L745 eck$LassoCheckResult]: Stem: 1456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1457#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1469#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1460#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1461#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1471#L519 assume true; 1473#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1474#L521 assume !(main_~val~0#1 < 0); 1479#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1475#L519 assume true; 1476#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1462#L521 assume !(main_~val~0#1 < 0); 1463#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1465#L519 assume true; 1472#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 1458#L526-3 main_~j~0#1 := 0; 1459#L526 assume true; 1466#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1481#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1480#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1470#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1467#L526 assume true; 1468#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1455#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1483#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1478#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1477#L526 assume true; 1449#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1450#L527 [2024-11-10 22:44:03,640 INFO L747 eck$LassoCheckResult]: Loop: 1450#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1453#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1450#L527 [2024-11-10 22:44:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 219565624, now seen corresponding path program 4 times [2024-11-10 22:44:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716988991] [2024-11-10 22:44:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716988991] [2024-11-10 22:44:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716988991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279766962] [2024-11-10 22:44:03,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:44:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:03,777 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:03,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-11-10 22:44:03,827 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:44:03,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:03,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:44:03,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279766962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:03,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-10 22:44:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775670237] [2024-11-10 22:44:03,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:03,989 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:03,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2024-11-10 22:44:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030159488] [2024-11-10 22:44:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:03,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:03,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 22:44:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-10 22:44:04,036 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:04,094 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2024-11-10 22:44:04,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 70 transitions. [2024-11-10 22:44:04,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:04,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 51 transitions. [2024-11-10 22:44:04,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:04,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:04,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-10 22:44:04,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:04,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-10 22:44:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-10 22:44:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-10 22:44:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.205128205128205) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-10 22:44:04,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-10 22:44:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 22:44:04,102 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-10 22:44:04,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 22:44:04,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2024-11-10 22:44:04,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:04,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:04,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:04,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:04,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:04,103 INFO L745 eck$LassoCheckResult]: Stem: 1729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1730#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1743#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1733#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1734#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1745#L519 assume true; 1748#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1756#L521 assume !(main_~val~0#1 < 0); 1757#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1758#L519 assume true; 1759#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1760#L521 assume !(main_~val~0#1 < 0); 1737#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1738#L519 assume true; 1747#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1735#L521 assume !(main_~val~0#1 < 0); 1736#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1752#L519 assume true; 1746#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 1731#L526-3 main_~j~0#1 := 0; 1732#L526 assume true; 1740#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1754#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1753#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1744#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1741#L526 assume true; 1742#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1728#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1751#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1750#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1749#L526 assume true; 1722#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 1723#L527 [2024-11-10 22:44:04,103 INFO L747 eck$LassoCheckResult]: Loop: 1723#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1726#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1723#L527 [2024-11-10 22:44:04,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 350602171, now seen corresponding path program 5 times [2024-11-10 22:44:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:04,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862526157] [2024-11-10 22:44:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:04,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2024-11-10 22:44:04,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147120417] [2024-11-10 22:44:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1921237530, now seen corresponding path program 2 times [2024-11-10 22:44:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917653886] [2024-11-10 22:44:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:04,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:04,745 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:04,745 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:04,745 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:04,745 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:04,745 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:04,745 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:04,745 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:04,745 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:04,745 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration11_Lasso [2024-11-10 22:44:04,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:04,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:04,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:04,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:05,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:05,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:05,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,174 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-10 22:44:05,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-10 22:44:05,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,201 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-10 22:44:05,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-10 22:44:05,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,227 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-10 22:44:05,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-10 22:44:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,252 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-10 22:44:05,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,289 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-10 22:44:05,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:05,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:05,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-10 22:44:05,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,318 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-10 22:44:05,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,343 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-10 22:44:05,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:05,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:05,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-10 22:44:05,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,370 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-10 22:44:05,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:05,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:05,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:05,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-10 22:44:05,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,395 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-10 22:44:05,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:05,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:05,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:05,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,429 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-10 22:44:05,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:05,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:05,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:05,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,460 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-10 22:44:05,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:05,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:05,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:05,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:05,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:05,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:05,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:05,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:05,496 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-10 22:44:05,496 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:05,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:05,499 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:05,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-10 22:44:05,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:05,518 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:05,519 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:05,519 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-11-10 22:44:05,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:05,550 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-10 22:44:05,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:05,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:05,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:05,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:05,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:44:05,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:05,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:05,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:05,703 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:05,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:05,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) Result 40 states and 49 transitions. Complement of second has 4 states. [2024-11-10 22:44:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:05,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-10 22:44:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:05,723 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:05,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:05,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:44:05,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:05,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:05,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:05,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:05,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:05,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) Result 40 states and 49 transitions. Complement of second has 4 states. [2024-11-10 22:44:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:05,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-10 22:44:05,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:05,888 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:05,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:44:05,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:06,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:06,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:06,025 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-10 22:44:06,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:06,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 47 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) Result 57 states and 70 transitions. Complement of second has 12 states. [2024-11-10 22:44:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-11-10 22:44:06,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-10 22:44:06,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:06,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 34 letters. Loop has 2 letters. [2024-11-10 22:44:06,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:06,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-10 22:44:06,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:06,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2024-11-10 22:44:06,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:06,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 62 transitions. [2024-11-10 22:44:06,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:06,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:06,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 62 transitions. [2024-11-10 22:44:06,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:06,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-10 22:44:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 62 transitions. [2024-11-10 22:44:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-10 22:44:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-10 22:44:06,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-10 22:44:06,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-10 22:44:06,123 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 22:44:06,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2024-11-10 22:44:06,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:06,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:06,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:06,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:06,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:06,128 INFO L745 eck$LassoCheckResult]: Stem: 2293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2294#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2308#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2299#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2300#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2311#L519 assume true; 2313#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2314#L521 assume !(main_~val~0#1 < 0); 2324#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2315#L519 assume true; 2316#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2301#L521 assume !(main_~val~0#1 < 0); 2302#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2303#L519 assume true; 2320#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2323#L521 assume !(main_~val~0#1 < 0); 2322#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2319#L519 assume true; 2312#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 2297#L526-3 main_~j~0#1 := 0; 2298#L526 assume true; 2291#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2292#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2333#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2332#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2306#L526 assume true; 2307#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2326#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2325#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2309#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2310#L526 assume true; 2331#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2330#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2328#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2321#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2317#L526 assume true; 2289#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2290#L527 [2024-11-10 22:44:06,130 INFO L747 eck$LassoCheckResult]: Loop: 2290#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2295#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2290#L527 [2024-11-10 22:44:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 853014411, now seen corresponding path program 6 times [2024-11-10 22:44:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570553237] [2024-11-10 22:44:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:06,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570553237] [2024-11-10 22:44:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570553237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541168341] [2024-11-10 22:44:06,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 22:44:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:06,286 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:06,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-10 22:44:06,346 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-10 22:44:06,346 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:06,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:06,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:06,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541168341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:06,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-10 22:44:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627183224] [2024-11-10 22:44:06,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:06,563 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2024-11-10 22:44:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470323616] [2024-11-10 22:44:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 22:44:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-10 22:44:06,603 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 15 Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:06,680 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-11-10 22:44:06,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2024-11-10 22:44:06,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:06,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 63 transitions. [2024-11-10 22:44:06,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:06,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:06,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2024-11-10 22:44:06,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:06,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 63 transitions. [2024-11-10 22:44:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2024-11-10 22:44:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-10 22:44:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-10 22:44:06,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-10 22:44:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:44:06,688 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-10 22:44:06,689 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-10 22:44:06,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 59 transitions. [2024-11-10 22:44:06,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:06,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:06,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:06,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:06,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:06,690 INFO L745 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2650#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2665#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2656#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2657#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2666#L519 assume true; 2668#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2658#L521 assume !(main_~val~0#1 < 0); 2659#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2660#L519 assume true; 2669#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2693#L521 assume !(main_~val~0#1 < 0); 2692#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2691#L519 assume true; 2690#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2689#L521 assume !(main_~val~0#1 < 0); 2688#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2687#L519 assume true; 2675#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2679#L521 assume !(main_~val~0#1 < 0); 2676#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2674#L519 assume true; 2667#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 2654#L526-3 main_~j~0#1 := 0; 2655#L526 assume true; 2663#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2661#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2652#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2653#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2664#L526 assume true; 2647#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2648#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2685#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2684#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2683#L526 assume true; 2682#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2681#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2673#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2672#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2670#L526 assume true; 2645#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 2646#L527 [2024-11-10 22:44:06,690 INFO L747 eck$LassoCheckResult]: Loop: 2646#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2651#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2646#L527 [2024-11-10 22:44:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 372311400, now seen corresponding path program 7 times [2024-11-10 22:44:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602560823] [2024-11-10 22:44:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:06,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2024-11-10 22:44:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818849614] [2024-11-10 22:44:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1308970119, now seen corresponding path program 3 times [2024-11-10 22:44:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994743810] [2024-11-10 22:44:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:06,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:07,342 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:07,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:07,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:07,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:07,342 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:07,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:07,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:07,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration13_Lasso [2024-11-10 22:44:07,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:07,342 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:07,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:07,765 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:07,765 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,767 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-10 22:44:07,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-10 22:44:07,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,792 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-10 22:44:07,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-11-10 22:44:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,816 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-10 22:44:07,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-10 22:44:07,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,841 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-10 22:44:07,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-10 22:44:07,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,866 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-10 22:44:07,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:07,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:07,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-10 22:44:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,892 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-10 22:44:07,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-10 22:44:07,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,917 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-10 22:44:07,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-10 22:44:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,941 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-10 22:44:07,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:07,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:07,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-10 22:44:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,969 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-10 22:44:07,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:07,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:07,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:07,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:07,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:07,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:07,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:07,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:07,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:07,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-10 22:44:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:07,994 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:07,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-10 22:44:07,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:08,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:08,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:08,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-10 22:44:08,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,018 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-10 22:44:08,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:08,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:08,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:08,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-10 22:44:08,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,044 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-10 22:44:08,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-10 22:44:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,073 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-10 22:44:08,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-10 22:44:08,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,102 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-10 22:44:08,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,130 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-10 22:44:08,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-10 22:44:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,156 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-10 22:44:08,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:08,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-10 22:44:08,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,189 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-10 22:44:08,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:08,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:08,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:08,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:08,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:08,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:08,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:08,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:08,216 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-10 22:44:08,216 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:08,217 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:08,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-10 22:44:08,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:08,229 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:08,229 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:08,229 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-11-10 22:44:08,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:08,250 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-10 22:44:08,251 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:08,251 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:08,252 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:08,423 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-10 22:44:08,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,443 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 50 states and 61 transitions. Complement of second has 4 states. [2024-11-10 22:44:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 41 letters. Loop has 2 letters. [2024-11-10 22:44:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:08,445 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:08,620 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-10 22:44:08,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 50 states and 61 transitions. Complement of second has 4 states. [2024-11-10 22:44:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:08,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 41 letters. Loop has 2 letters. [2024-11-10 22:44:08,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:08,646 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:08,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:08,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:08,813 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-10 22:44:08,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:08,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 68 states and 84 transitions. Complement of second has 14 states. [2024-11-10 22:44:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2024-11-10 22:44:08,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 41 letters. Loop has 2 letters. [2024-11-10 22:44:08,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:08,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 43 letters. Loop has 2 letters. [2024-11-10 22:44:08,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:08,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 41 letters. Loop has 4 letters. [2024-11-10 22:44:08,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:08,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 84 transitions. [2024-11-10 22:44:08,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:08,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 76 transitions. [2024-11-10 22:44:08,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:08,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:08,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 76 transitions. [2024-11-10 22:44:08,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:08,936 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-10 22:44:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 76 transitions. [2024-11-10 22:44:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2024-11-10 22:44:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-10 22:44:08,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-10 22:44:08,939 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-10 22:44:08,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-10 22:44:08,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2024-11-10 22:44:08,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:08,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:08,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:08,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:08,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:08,941 INFO L745 eck$LassoCheckResult]: Stem: 3350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3351#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3362#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3354#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3355#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3365#L519 assume true; 3367#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3356#L521 assume !(main_~val~0#1 < 0); 3357#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3359#L519 assume true; 3368#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3382#L521 assume !(main_~val~0#1 < 0); 3381#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3380#L519 assume true; 3379#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3378#L521 assume !(main_~val~0#1 < 0); 3377#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3376#L519 assume true; 3372#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3375#L521 assume !(main_~val~0#1 < 0); 3374#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3371#L519 assume true; 3366#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 3352#L526-3 main_~j~0#1 := 0; 3353#L526 assume true; 3360#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3397#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3396#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3395#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3361#L526 assume true; 3346#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3347#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3358#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3363#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3364#L526 assume true; 3394#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3392#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3391#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3390#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3389#L526 assume true; 3388#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3387#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3383#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3373#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3369#L526 assume true; 3344#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3345#L527 [2024-11-10 22:44:08,941 INFO L747 eck$LassoCheckResult]: Loop: 3345#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3348#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3345#L527 [2024-11-10 22:44:08,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1520679422, now seen corresponding path program 8 times [2024-11-10 22:44:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:08,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488042960] [2024-11-10 22:44:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488042960] [2024-11-10 22:44:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488042960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486107089] [2024-11-10 22:44:09,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:44:09,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:09,109 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:09,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2024-11-10 22:44:09,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:44:09,177 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:09,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:44:09,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:09,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486107089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:09,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-10 22:44:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406603128] [2024-11-10 22:44:09,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:09,442 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:09,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2024-11-10 22:44:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517030092] [2024-11-10 22:44:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:09,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 22:44:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-10 22:44:09,484 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. cyclomatic complexity: 18 Second operand has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:09,574 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2024-11-10 22:44:09,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 108 transitions. [2024-11-10 22:44:09,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:09,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 62 states and 75 transitions. [2024-11-10 22:44:09,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:09,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:09,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 75 transitions. [2024-11-10 22:44:09,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:09,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-11-10 22:44:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 75 transitions. [2024-11-10 22:44:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-10 22:44:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-10 22:44:09,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-10 22:44:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 22:44:09,579 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-10 22:44:09,579 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-10 22:44:09,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 71 transitions. [2024-11-10 22:44:09,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:09,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:09,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:09,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:09,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:09,580 INFO L745 eck$LassoCheckResult]: Stem: 3789#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3790#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3801#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3793#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3794#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3805#L519 assume true; 3806#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3841#L521 assume !(main_~val~0#1 < 0); 3840#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3807#L519 assume true; 3804#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3795#L521 assume !(main_~val~0#1 < 0); 3796#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3797#L519 assume true; 3839#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3838#L521 assume !(main_~val~0#1 < 0); 3837#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3836#L519 assume true; 3835#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3834#L521 assume !(main_~val~0#1 < 0); 3833#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3832#L519 assume true; 3813#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3817#L521 assume !(main_~val~0#1 < 0); 3814#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3812#L519 assume true; 3803#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 3791#L526-3 main_~j~0#1 := 0; 3792#L526 assume true; 3785#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3786#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3798#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3802#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3799#L526 assume true; 3800#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3830#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3829#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3828#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3827#L526 assume true; 3826#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3824#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3823#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3822#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3821#L526 assume true; 3820#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3819#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3811#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3810#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3808#L526 assume true; 3783#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 3784#L527 [2024-11-10 22:44:09,580 INFO L747 eck$LassoCheckResult]: Loop: 3784#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3787#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3784#L527 [2024-11-10 22:44:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -913312575, now seen corresponding path program 9 times [2024-11-10 22:44:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850397356] [2024-11-10 22:44:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:09,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2024-11-10 22:44:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809458812] [2024-11-10 22:44:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1520055904, now seen corresponding path program 4 times [2024-11-10 22:44:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450860881] [2024-11-10 22:44:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:09,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:10,595 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:10,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:10,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:10,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:10,595 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:10,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:10,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:10,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:10,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration15_Lasso [2024-11-10 22:44:10,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:10,595 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:10,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:10,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:11,021 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:11,022 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,023 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-10 22:44:11,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 [2024-11-10 22:44:11,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-10 22:44:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,047 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-10 22:44:11,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-10 22:44:11,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,072 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-10 22:44:11,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-11-10 22:44:11,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,096 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-10 22:44:11,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 [2024-11-10 22:44:11,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-10 22:44:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,120 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-10 22:44:11,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-10 22:44:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,145 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-10 22:44:11,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-10 22:44:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,170 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-10 22:44:11,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-10 22:44:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,194 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-10 22:44:11,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:11,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:11,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:11,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,219 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-10 22:44:11,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:11,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,243 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-10 22:44:11,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:11,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:11,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:11,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:11,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:11,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,267 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-10 22:44:11,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:11,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:11,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:11,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:11,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:11,292 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-10 22:44:11,292 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-10 22:44:11,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:11,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:11,293 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:11,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-10 22:44:11,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:11,305 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:11,305 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:11,305 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-10 22:44:11,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-11-10 22:44:11,331 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-10 22:44:11,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:11,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:11,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:11,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:11,508 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-10 22:44:11,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:11,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 60 states and 73 transitions. Complement of second has 4 states. [2024-11-10 22:44:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 50 letters. Loop has 2 letters. [2024-11-10 22:44:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:11,535 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:11,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:11,713 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-10 22:44:11,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:11,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 60 states and 73 transitions. Complement of second has 4 states. [2024-11-10 22:44:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:11,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 50 letters. Loop has 2 letters. [2024-11-10 22:44:11,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:11,737 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:11,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:11,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:11,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:11,905 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-10 22:44:11,905 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:12,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 71 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 79 states and 98 transitions. Complement of second has 16 states. [2024-11-10 22:44:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2024-11-10 22:44:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 50 letters. Loop has 2 letters. [2024-11-10 22:44:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 52 letters. Loop has 2 letters. [2024-11-10 22:44:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 50 letters. Loop has 4 letters. [2024-11-10 22:44:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:12,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 98 transitions. [2024-11-10 22:44:12,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:12,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 73 states and 90 transitions. [2024-11-10 22:44:12,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:12,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:12,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 90 transitions. [2024-11-10 22:44:12,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:12,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-10 22:44:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 90 transitions. [2024-11-10 22:44:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-10 22:44:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2024-11-10 22:44:12,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 78 transitions. [2024-11-10 22:44:12,027 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 78 transitions. [2024-11-10 22:44:12,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-10 22:44:12,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 78 transitions. [2024-11-10 22:44:12,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:12,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:12,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:12,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:12,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:12,029 INFO L745 eck$LassoCheckResult]: Stem: 4620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4621#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 4632#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 4624#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 4625#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4635#L519 assume true; 4637#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4626#L521 assume !(main_~val~0#1 < 0); 4627#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4629#L519 assume true; 4638#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4656#L521 assume !(main_~val~0#1 < 0); 4655#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4654#L519 assume true; 4653#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4652#L521 assume !(main_~val~0#1 < 0); 4651#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4650#L519 assume true; 4649#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4648#L521 assume !(main_~val~0#1 < 0); 4647#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4646#L519 assume true; 4642#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4645#L521 assume !(main_~val~0#1 < 0); 4644#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4641#L519 assume true; 4636#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 4622#L526-3 main_~j~0#1 := 0; 4623#L526 assume true; 4630#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4677#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4676#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4675#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4631#L526 assume true; 4616#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4617#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4628#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4633#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4634#L526 assume true; 4674#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4672#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4671#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4670#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4669#L526 assume true; 4668#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4666#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4665#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4664#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4663#L526 assume true; 4662#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4658#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4657#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4643#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4639#L526 assume true; 4614#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 4615#L527 [2024-11-10 22:44:12,029 INFO L747 eck$LassoCheckResult]: Loop: 4615#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4618#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4615#L527 [2024-11-10 22:44:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2145289659, now seen corresponding path program 10 times [2024-11-10 22:44:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282283502] [2024-11-10 22:44:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 38 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282283502] [2024-11-10 22:44:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282283502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444921492] [2024-11-10 22:44:12,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:44:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:12,229 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:12,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2024-11-10 22:44:12,290 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:44:12,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:12,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:44:12,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:12,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444921492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:12,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:12,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-11-10 22:44:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446235493] [2024-11-10 22:44:12,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:12,616 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2024-11-10 22:44:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680596333] [2024-11-10 22:44:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 22:44:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-10 22:44:12,659 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. cyclomatic complexity: 21 Second operand has 23 states, 22 states have (on average 4.2727272727272725) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:12,776 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2024-11-10 22:44:12,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 127 transitions. [2024-11-10 22:44:12,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:12,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 72 states and 87 transitions. [2024-11-10 22:44:12,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:12,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:12,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 87 transitions. [2024-11-10 22:44:12,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:12,778 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-10 22:44:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 87 transitions. [2024-11-10 22:44:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-10 22:44:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-11-10 22:44:12,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-10 22:44:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 22:44:12,781 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-10 22:44:12,782 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-10 22:44:12,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2024-11-10 22:44:12,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:12,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:12,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:12,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:12,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:12,783 INFO L745 eck$LassoCheckResult]: Stem: 5142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5143#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5156#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 5146#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5147#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5158#L519 assume true; 5161#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5204#L521 assume !(main_~val~0#1 < 0); 5203#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5162#L519 assume true; 5160#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5148#L521 assume !(main_~val~0#1 < 0); 5149#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5153#L519 assume true; 5202#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5201#L521 assume !(main_~val~0#1 < 0); 5200#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5199#L519 assume true; 5198#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5197#L521 assume !(main_~val~0#1 < 0); 5196#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5195#L519 assume true; 5194#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5193#L521 assume !(main_~val~0#1 < 0); 5192#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5191#L519 assume true; 5166#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5170#L521 assume !(main_~val~0#1 < 0); 5168#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5165#L519 assume true; 5159#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 5144#L526-3 main_~j~0#1 := 0; 5145#L526 assume true; 5154#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5150#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5151#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5157#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5155#L526 assume true; 5138#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5139#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5190#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5189#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5188#L526 assume true; 5187#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5185#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5184#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5183#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5182#L526 assume true; 5181#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5179#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5178#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5177#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5176#L526 assume true; 5175#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5174#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5169#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5167#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5163#L526 assume true; 5136#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 5137#L527 [2024-11-10 22:44:12,784 INFO L747 eck$LassoCheckResult]: Loop: 5137#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5140#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5137#L527 [2024-11-10 22:44:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -767055134, now seen corresponding path program 11 times [2024-11-10 22:44:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:12,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648966788] [2024-11-10 22:44:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:12,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2024-11-10 22:44:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955967895] [2024-11-10 22:44:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:12,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1594391425, now seen corresponding path program 5 times [2024-11-10 22:44:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:12,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656446553] [2024-11-10 22:44:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:12,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:12,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:14,853 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:14,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:14,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:14,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:14,853 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:14,853 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:14,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:14,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:14,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration17_Lasso [2024-11-10 22:44:14,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:14,854 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:14,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:14,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:14,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:14,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:14,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:14,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:15,762 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:15,762 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,763 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-10 22:44:15,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:15,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:15,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:15,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:15,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-10 22:44:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,788 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-10 22:44:15,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:15,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:15,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:15,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:15,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-10 22:44:15,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,816 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-10 22:44:15,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:15,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:15,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:15,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:15,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-11-10 22:44:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,841 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-10 22:44:15,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:15,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:15,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:15,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:15,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:15,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,865 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-10 22:44:15,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:15,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:15,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:15,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:15,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-10 22:44:15,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,889 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-10 22:44:15,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:15,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:15,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:15,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:15,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:15,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:15,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:15,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:15,914 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-10 22:44:15,914 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:15,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:15,916 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:15,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-10 22:44:15,917 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:15,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:15,928 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:15,928 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 20))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 20))_1 Supporting invariants [] [2024-11-10 22:44:15,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:15,969 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2024-11-10 22:44:15,971 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:15,971 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:15,971 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:15,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:16,165 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-10 22:44:16,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,202 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 85 transitions. Complement of second has 4 states. [2024-11-10 22:44:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:16,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 59 letters. Loop has 2 letters. [2024-11-10 22:44:16,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:16,203 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:16,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:16,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-10 22:44:16,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 85 transitions. Complement of second has 4 states. [2024-11-10 22:44:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:16,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 59 letters. Loop has 2 letters. [2024-11-10 22:44:16,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:16,407 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:16,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:16,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:16,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:16,613 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-10 22:44:16,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 83 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 112 transitions. Complement of second has 18 states. [2024-11-10 22:44:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2024-11-10 22:44:16,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 59 letters. Loop has 2 letters. [2024-11-10 22:44:16,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:16,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 61 letters. Loop has 2 letters. [2024-11-10 22:44:16,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:16,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 64 transitions. Stem has 59 letters. Loop has 4 letters. [2024-11-10 22:44:16,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:16,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 112 transitions. [2024-11-10 22:44:16,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:16,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 84 states and 104 transitions. [2024-11-10 22:44:16,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:16,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:16,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 104 transitions. [2024-11-10 22:44:16,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:16,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 104 transitions. [2024-11-10 22:44:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 104 transitions. [2024-11-10 22:44:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2024-11-10 22:44:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-11-10 22:44:16,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-10 22:44:16,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-10 22:44:16,752 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-10 22:44:16,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 90 transitions. [2024-11-10 22:44:16,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:16,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:16,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:16,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:16,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:16,754 INFO L745 eck$LassoCheckResult]: Stem: 6125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6126#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6137#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 6129#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6130#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6142#L519 assume true; 6141#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6131#L521 assume !(main_~val~0#1 < 0); 6132#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6133#L519 assume true; 6143#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6165#L521 assume !(main_~val~0#1 < 0); 6164#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6163#L519 assume true; 6162#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6161#L521 assume !(main_~val~0#1 < 0); 6160#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6159#L519 assume true; 6158#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6157#L521 assume !(main_~val~0#1 < 0); 6156#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6155#L519 assume true; 6154#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6153#L521 assume !(main_~val~0#1 < 0); 6152#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6151#L519 assume true; 6147#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6150#L521 assume !(main_~val~0#1 < 0); 6148#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6146#L519 assume true; 6140#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 6127#L526-3 main_~j~0#1 := 0; 6128#L526 assume true; 6135#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6192#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6191#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6190#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6136#L526 assume true; 6121#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6122#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6134#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6138#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6139#L526 assume true; 6189#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6187#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6186#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6185#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6184#L526 assume true; 6183#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6181#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6180#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6179#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6178#L526 assume true; 6177#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6175#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6174#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6173#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6172#L526 assume true; 6171#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6170#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6166#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6149#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6144#L526 assume true; 6119#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6120#L527 [2024-11-10 22:44:16,754 INFO L747 eck$LassoCheckResult]: Loop: 6120#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6123#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6120#L527 [2024-11-10 22:44:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 471560388, now seen corresponding path program 12 times [2024-11-10 22:44:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685090076] [2024-11-10 22:44:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 60 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:17,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:17,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685090076] [2024-11-10 22:44:17,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685090076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:17,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741393348] [2024-11-10 22:44:17,018 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 22:44:17,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:17,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:17,021 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:17,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2024-11-10 22:44:17,129 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-10 22:44:17,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:17,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 22:44:17,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 87 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:17,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 87 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741393348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:17,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-11-10 22:44:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951430385] [2024-11-10 22:44:17,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:17,533 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 13 times [2024-11-10 22:44:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261326576] [2024-11-10 22:44:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 22:44:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-11-10 22:44:17,584 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. cyclomatic complexity: 24 Second operand has 26 states, 25 states have (on average 4.32) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:17,695 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-11-10 22:44:17,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 146 transitions. [2024-11-10 22:44:17,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:17,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 82 states and 99 transitions. [2024-11-10 22:44:17,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:17,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:17,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 99 transitions. [2024-11-10 22:44:17,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:17,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 99 transitions. [2024-11-10 22:44:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 99 transitions. [2024-11-10 22:44:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-10 22:44:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2024-11-10 22:44:17,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 95 transitions. [2024-11-10 22:44:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 22:44:17,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2024-11-10 22:44:17,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-10 22:44:17,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 95 transitions. [2024-11-10 22:44:17,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:17,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:17,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:17,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:17,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:17,707 INFO L745 eck$LassoCheckResult]: Stem: 6730#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6731#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6742#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 6734#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6735#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6744#L519 assume true; 6746#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6736#L521 assume !(main_~val~0#1 < 0); 6737#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6739#L519 assume true; 6747#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6802#L521 assume !(main_~val~0#1 < 0); 6801#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6800#L519 assume true; 6799#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6798#L521 assume !(main_~val~0#1 < 0); 6797#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6796#L519 assume true; 6795#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6794#L521 assume !(main_~val~0#1 < 0); 6793#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6792#L519 assume true; 6791#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6790#L521 assume !(main_~val~0#1 < 0); 6789#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6788#L519 assume true; 6787#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6786#L521 assume !(main_~val~0#1 < 0); 6785#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6784#L519 assume true; 6751#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6755#L521 assume !(main_~val~0#1 < 0); 6753#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6750#L519 assume true; 6745#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 6732#L526-3 main_~j~0#1 := 0; 6733#L526 assume true; 6726#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6727#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6738#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6743#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6740#L526 assume true; 6741#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6782#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6781#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6780#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6779#L526 assume true; 6778#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6776#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6775#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6774#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6773#L526 assume true; 6772#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6770#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6769#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6768#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6767#L526 assume true; 6766#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6764#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6763#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6762#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6761#L526 assume true; 6760#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6759#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6754#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6752#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6748#L526 assume true; 6724#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 6725#L527 [2024-11-10 22:44:17,707 INFO L747 eck$LassoCheckResult]: Loop: 6725#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6728#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6725#L527 [2024-11-10 22:44:17,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1794482375, now seen corresponding path program 13 times [2024-11-10 22:44:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:17,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979486356] [2024-11-10 22:44:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 14 times [2024-11-10 22:44:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697667391] [2024-11-10 22:44:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2079290330, now seen corresponding path program 6 times [2024-11-10 22:44:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:17,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572829945] [2024-11-10 22:44:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:17,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:21,040 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:21,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:21,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:21,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:21,041 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:21,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:21,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:21,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:21,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration19_Lasso [2024-11-10 22:44:21,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:21,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:21,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:21,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:22,352 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:22,352 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:22,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,356 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-10 22:44:22,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-10 22:44:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,380 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-10 22:44:22,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-10 22:44:22,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,406 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-10 22:44:22,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,432 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-10 22:44:22,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-10 22:44:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,458 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-10 22:44:22,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,484 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-10 22:44:22,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-10 22:44:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,509 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-10 22:44:22,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:22,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:22,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:22,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-10 22:44:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,556 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-10 22:44:22,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-10 22:44:22,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,585 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-10 22:44:22,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-10 22:44:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,613 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-10 22:44:22,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,642 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-10 22:44:22,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-10 22:44:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,670 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-10 22:44:22,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:22,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-11-10 22:44:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,697 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-10 22:44:22,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:22,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:22,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:22,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:22,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:22,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:22,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:22,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:22,721 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-10 22:44:22,721 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:22,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:22,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:22,722 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:22,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-10 22:44:22,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:22,734 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:22,734 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:22,734 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2024-11-10 22:44:22,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-11-10 22:44:22,790 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-11-10 22:44:22,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:22,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:22,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:22,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 22:44:22,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:23,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:23,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-10 22:44:23,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,048 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 80 states and 97 transitions. Complement of second has 4 states. [2024-11-10 22:44:23,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:23,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-10 22:44:23,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:23,049 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:23,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 22:44:23,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:23,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:23,320 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-10 22:44:23,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,338 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 80 states and 97 transitions. Complement of second has 4 states. [2024-11-10 22:44:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:23,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-10 22:44:23,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:23,339 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 22:44:23,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:23,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:23,551 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-10 22:44:23,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,696 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 95 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 101 states and 126 transitions. Complement of second has 20 states. [2024-11-10 22:44:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2024-11-10 22:44:23,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 68 letters. Loop has 2 letters. [2024-11-10 22:44:23,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:23,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 70 letters. Loop has 2 letters. [2024-11-10 22:44:23,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:23,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 68 letters. Loop has 4 letters. [2024-11-10 22:44:23,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:23,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 126 transitions. [2024-11-10 22:44:23,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:23,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 95 states and 118 transitions. [2024-11-10 22:44:23,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:23,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:23,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 118 transitions. [2024-11-10 22:44:23,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:23,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-11-10 22:44:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 118 transitions. [2024-11-10 22:44:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-10 22:44:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.2) internal successors, (102), 84 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-11-10 22:44:23,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-10 22:44:23,704 INFO L425 stractBuchiCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-11-10 22:44:23,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-10 22:44:23,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 102 transitions. [2024-11-10 22:44:23,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:23,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:23,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:23,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:23,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:23,706 INFO L745 eck$LassoCheckResult]: Stem: 7849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7850#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 7861#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 7853#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7854#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7864#L519 assume true; 7866#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7855#L521 assume !(main_~val~0#1 < 0); 7856#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7858#L519 assume true; 7867#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7893#L521 assume !(main_~val~0#1 < 0); 7892#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7891#L519 assume true; 7890#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7889#L521 assume !(main_~val~0#1 < 0); 7888#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7887#L519 assume true; 7886#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7885#L521 assume !(main_~val~0#1 < 0); 7884#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7883#L519 assume true; 7882#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7881#L521 assume !(main_~val~0#1 < 0); 7880#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7879#L519 assume true; 7878#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7877#L521 assume !(main_~val~0#1 < 0); 7876#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7875#L519 assume true; 7871#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7874#L521 assume !(main_~val~0#1 < 0); 7873#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7870#L519 assume true; 7865#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 7851#L526-3 main_~j~0#1 := 0; 7852#L526 assume true; 7859#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7926#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7925#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7924#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7860#L526 assume true; 7845#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7846#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7857#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7862#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7863#L526 assume true; 7923#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7921#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7920#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7919#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7918#L526 assume true; 7917#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7915#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7914#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7913#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7912#L526 assume true; 7911#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7909#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7908#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7907#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7906#L526 assume true; 7905#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7903#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7902#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7901#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7900#L526 assume true; 7899#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7898#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7894#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7872#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7868#L526 assume true; 7843#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 7844#L527 [2024-11-10 22:44:23,707 INFO L747 eck$LassoCheckResult]: Loop: 7844#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7847#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 7844#L527 [2024-11-10 22:44:23,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2119933441, now seen corresponding path program 14 times [2024-11-10 22:44:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596189914] [2024-11-10 22:44:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:23,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-11-10 22:44:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 87 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:24,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596189914] [2024-11-10 22:44:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596189914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:24,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360187576] [2024-11-10 22:44:24,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:44:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:24,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:24,098 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2024-11-10 22:44:24,206 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:44:24,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:24,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 22:44:24,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 119 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:24,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 119 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360187576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:24,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:24,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-11-10 22:44:24,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938330447] [2024-11-10 22:44:24,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:24,696 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 15 times [2024-11-10 22:44:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576674912] [2024-11-10 22:44:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:24,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 22:44:24,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2024-11-10 22:44:24,740 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:24,915 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2024-11-10 22:44:24,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 165 transitions. [2024-11-10 22:44:24,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:24,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 92 states and 111 transitions. [2024-11-10 22:44:24,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:24,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:24,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 111 transitions. [2024-11-10 22:44:24,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:24,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-10 22:44:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 111 transitions. [2024-11-10 22:44:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-10 22:44:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.202247191011236) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-11-10 22:44:24,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-11-10 22:44:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 22:44:24,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-11-10 22:44:24,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-10 22:44:24,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 107 transitions. [2024-11-10 22:44:24,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:24,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:24,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:24,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:24,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:24,925 INFO L745 eck$LassoCheckResult]: Stem: 8537#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8538#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 8551#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 8541#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8542#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8553#L519 assume true; 8556#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8619#L521 assume !(main_~val~0#1 < 0); 8618#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8557#L519 assume true; 8555#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8543#L521 assume !(main_~val~0#1 < 0); 8544#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8548#L519 assume true; 8617#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8616#L521 assume !(main_~val~0#1 < 0); 8615#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8614#L519 assume true; 8613#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8612#L521 assume !(main_~val~0#1 < 0); 8611#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8610#L519 assume true; 8609#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8608#L521 assume !(main_~val~0#1 < 0); 8607#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8606#L519 assume true; 8605#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8604#L521 assume !(main_~val~0#1 < 0); 8603#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8602#L519 assume true; 8601#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8600#L521 assume !(main_~val~0#1 < 0); 8599#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8598#L519 assume true; 8561#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8565#L521 assume !(main_~val~0#1 < 0); 8563#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8560#L519 assume true; 8554#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 8539#L526-3 main_~j~0#1 := 0; 8540#L526 assume true; 8549#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8545#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8546#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8552#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8550#L526 assume true; 8533#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8534#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8597#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8596#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8595#L526 assume true; 8594#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8592#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8591#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8590#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8589#L526 assume true; 8588#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8586#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8585#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8584#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8583#L526 assume true; 8582#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8580#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8579#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8578#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8577#L526 assume true; 8576#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8574#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8573#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8572#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8571#L526 assume true; 8570#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8569#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8564#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8562#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8558#L526 assume true; 8531#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 8532#L527 [2024-11-10 22:44:24,925 INFO L747 eck$LassoCheckResult]: Loop: 8532#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8535#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 8532#L527 [2024-11-10 22:44:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -367229604, now seen corresponding path program 15 times [2024-11-10 22:44:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592686603] [2024-11-10 22:44:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 16 times [2024-11-10 22:44:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018410191] [2024-11-10 22:44:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:24,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -720330885, now seen corresponding path program 7 times [2024-11-10 22:44:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775923936] [2024-11-10 22:44:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:25,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:25,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:27,525 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:27,526 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:27,526 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:27,526 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:27,526 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:27,526 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:27,526 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:27,526 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:27,526 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration21_Lasso [2024-11-10 22:44:27,526 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:27,526 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:27,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:27,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:28,136 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:28,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:28,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,139 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-10 22:44:28,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-11-10 22:44:28,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,164 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-10 22:44:28,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-11-10 22:44:28,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,188 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-10 22:44:28,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-10 22:44:28,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,212 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-10 22:44:28,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-10 22:44:28,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,236 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-10 22:44:28,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,281 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-10 22:44:28,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-10 22:44:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,305 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-10 22:44:28,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,329 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-10 22:44:28,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-11-10 22:44:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,353 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-10 22:44:28,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,379 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-10 22:44:28,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-10 22:44:28,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,405 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-10 22:44:28,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:28,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:28,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:28,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-10 22:44:28,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,429 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-10 22:44:28,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,455 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-10 22:44:28,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,492 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-11-10 22:44:28,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-11-10 22:44:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,519 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-10 22:44:28,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-10 22:44:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,546 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-10 22:44:28,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:28,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:28,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,574 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-10 22:44:28,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:28,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:28,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:28,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:28,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:28,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:28,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:28,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:28,601 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-10 22:44:28,601 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:28,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:28,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:28,602 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:28,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-10 22:44:28,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:28,614 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:28,614 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:28,614 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 28))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 28))_1 Supporting invariants [] [2024-11-10 22:44:28,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-10 22:44:28,640 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-10 22:44:28,641 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:28,642 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:28,642 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:28,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:28,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 22:44:28,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:28,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:28,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:28,929 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2024-11-10 22:44:28,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28 Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:28,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 109 transitions. Complement of second has 4 states. [2024-11-10 22:44:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:28,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 77 letters. Loop has 2 letters. [2024-11-10 22:44:28,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:28,956 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:29,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 22:44:29,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:29,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:29,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:29,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2024-11-10 22:44:29,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28 Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:29,224 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 109 transitions. Complement of second has 4 states. [2024-11-10 22:44:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:29,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 77 letters. Loop has 2 letters. [2024-11-10 22:44:29,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:29,225 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:29,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 22:44:29,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:29,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:29,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:29,496 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2024-11-10 22:44:29,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28 Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:29,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 107 transitions. cyclomatic complexity: 28. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 140 transitions. Complement of second has 22 states. [2024-11-10 22:44:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2024-11-10 22:44:29,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 78 transitions. Stem has 77 letters. Loop has 2 letters. [2024-11-10 22:44:29,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:29,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 78 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-10 22:44:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:29,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 78 transitions. Stem has 77 letters. Loop has 4 letters. [2024-11-10 22:44:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:29,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 140 transitions. [2024-11-10 22:44:29,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:29,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 106 states and 132 transitions. [2024-11-10 22:44:29,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:29,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:29,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 132 transitions. [2024-11-10 22:44:29,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:29,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 132 transitions. [2024-11-10 22:44:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 132 transitions. [2024-11-10 22:44:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-11-10 22:44:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.2) internal successors, (114), 94 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2024-11-10 22:44:29,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 114 transitions. [2024-11-10 22:44:29,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 114 transitions. [2024-11-10 22:44:29,680 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-10 22:44:29,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 114 transitions. [2024-11-10 22:44:29,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:29,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:29,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:29,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:29,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:29,681 INFO L745 eck$LassoCheckResult]: Stem: 9764#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9765#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9776#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 9768#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 9769#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 9779#L519 assume true; 9781#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9770#L521 assume !(main_~val~0#1 < 0); 9771#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9773#L519 assume true; 9782#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9812#L521 assume !(main_~val~0#1 < 0); 9811#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9810#L519 assume true; 9809#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9808#L521 assume !(main_~val~0#1 < 0); 9807#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9806#L519 assume true; 9805#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9804#L521 assume !(main_~val~0#1 < 0); 9803#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9802#L519 assume true; 9801#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9800#L521 assume !(main_~val~0#1 < 0); 9799#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9798#L519 assume true; 9797#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9796#L521 assume !(main_~val~0#1 < 0); 9795#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9794#L519 assume true; 9793#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9792#L521 assume !(main_~val~0#1 < 0); 9791#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9790#L519 assume true; 9786#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9789#L521 assume !(main_~val~0#1 < 0); 9788#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9785#L519 assume true; 9780#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 9766#L526-3 main_~j~0#1 := 0; 9767#L526 assume true; 9774#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9851#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9850#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9849#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9775#L526 assume true; 9760#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9761#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9772#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9777#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9778#L526 assume true; 9848#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9846#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9845#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9844#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9843#L526 assume true; 9842#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9840#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9839#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9838#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9837#L526 assume true; 9836#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9834#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9833#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9832#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9831#L526 assume true; 9830#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9828#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9827#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9826#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9825#L526 assume true; 9824#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9822#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9821#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9820#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9819#L526 assume true; 9818#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9814#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9813#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9787#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9783#L526 assume true; 9758#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 9759#L527 [2024-11-10 22:44:29,685 INFO L747 eck$LassoCheckResult]: Loop: 9759#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9762#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 9759#L527 [2024-11-10 22:44:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1720839542, now seen corresponding path program 16 times [2024-11-10 22:44:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982265699] [2024-11-10 22:44:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:29,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-10 22:44:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 119 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982265699] [2024-11-10 22:44:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982265699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767189246] [2024-11-10 22:44:30,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:44:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:30,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:30,078 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2024-11-10 22:44:30,164 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:44:30,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:30,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 22:44:30,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 156 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:30,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 156 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767189246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:30,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-11-10 22:44:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085703250] [2024-11-10 22:44:30,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:30,621 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:30,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 17 times [2024-11-10 22:44:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683075482] [2024-11-10 22:44:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 22:44:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-11-10 22:44:30,664 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. cyclomatic complexity: 30 Second operand has 32 states, 31 states have (on average 4.387096774193548) internal successors, (136), 32 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:30,814 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2024-11-10 22:44:30,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 184 transitions. [2024-11-10 22:44:30,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:30,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 102 states and 123 transitions. [2024-11-10 22:44:30,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:30,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:30,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 123 transitions. [2024-11-10 22:44:30,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:30,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-10 22:44:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 123 transitions. [2024-11-10 22:44:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-10 22:44:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.202020202020202) internal successors, (119), 98 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-11-10 22:44:30,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-10 22:44:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 22:44:30,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-10 22:44:30,820 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-10 22:44:30,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 119 transitions. [2024-11-10 22:44:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:30,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:30,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:30,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:30,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:30,822 INFO L745 eck$LassoCheckResult]: Stem: 10535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10536#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10547#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 10539#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10540#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 10549#L519 assume true; 10551#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10541#L521 assume !(main_~val~0#1 < 0); 10542#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10544#L519 assume true; 10552#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10627#L521 assume !(main_~val~0#1 < 0); 10626#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10625#L519 assume true; 10624#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10623#L521 assume !(main_~val~0#1 < 0); 10622#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10621#L519 assume true; 10620#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10619#L521 assume !(main_~val~0#1 < 0); 10618#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10617#L519 assume true; 10616#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10615#L521 assume !(main_~val~0#1 < 0); 10614#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10613#L519 assume true; 10612#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10611#L521 assume !(main_~val~0#1 < 0); 10610#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10609#L519 assume true; 10608#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10607#L521 assume !(main_~val~0#1 < 0); 10606#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10605#L519 assume true; 10604#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10603#L521 assume !(main_~val~0#1 < 0); 10602#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10601#L519 assume true; 10556#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10560#L521 assume !(main_~val~0#1 < 0); 10558#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10555#L519 assume true; 10550#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 10537#L526-3 main_~j~0#1 := 0; 10538#L526 assume true; 10531#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10532#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10543#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10548#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10545#L526 assume true; 10546#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10599#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10598#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10597#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10596#L526 assume true; 10595#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10593#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10592#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10591#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10590#L526 assume true; 10589#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10587#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10586#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10585#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10584#L526 assume true; 10583#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10581#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10580#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10579#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10578#L526 assume true; 10577#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10575#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10574#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10573#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10572#L526 assume true; 10571#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10569#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10568#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10567#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10566#L526 assume true; 10565#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10564#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10559#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10557#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10553#L526 assume true; 10529#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 10530#L527 [2024-11-10 22:44:30,822 INFO L747 eck$LassoCheckResult]: Loop: 10530#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10533#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 10530#L527 [2024-11-10 22:44:30,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash 18573261, now seen corresponding path program 17 times [2024-11-10 22:44:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253328089] [2024-11-10 22:44:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:30,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 18 times [2024-11-10 22:44:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:30,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093665373] [2024-11-10 22:44:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 669034924, now seen corresponding path program 8 times [2024-11-10 22:44:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519860423] [2024-11-10 22:44:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:30,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:36,439 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 301 DAG size of output: 221 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 22:44:37,198 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:37,198 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:37,198 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:37,198 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:37,198 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:37,198 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:37,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:37,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:37,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration23_Lasso [2024-11-10 22:44:37,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:37,199 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:37,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:37,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:39,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:39,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:39,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:39,556 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:39,556 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,559 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-10 22:44:39,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:39,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,585 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-10 22:44:39,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-11-10 22:44:39,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,611 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-10 22:44:39,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-10 22:44:39,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,639 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-10 22:44:39,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-11-10 22:44:39,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,666 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-10 22:44:39,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-10 22:44:39,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,719 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-10 22:44:39,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-10 22:44:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,745 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-10 22:44:39,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-11-10 22:44:39,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,795 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-10 22:44:39,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-11-10 22:44:39,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,819 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-11-10 22:44:39,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-11-10 22:44:39,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,843 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-10 22:44:39,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-10 22:44:39,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,867 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-10 22:44:39,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:39,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:39,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:39,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-10 22:44:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,892 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-10 22:44:39,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2024-11-10 22:44:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,922 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-10 22:44:39,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2024-11-10 22:44:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,955 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-10 22:44:39,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:39,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:39,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:39,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:39,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-11-10 22:44:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:39,983 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:39,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-10 22:44:39,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:39,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:39,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:39,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:39,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:40,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,042 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-10 22:44:40,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,074 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-11-10 22:44:40,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-11-10 22:44:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,103 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-10 22:44:40,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-11-10 22:44:40,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,134 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-10 22:44:40,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-11-10 22:44:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,163 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-10 22:44:40,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:40,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-11-10 22:44:40,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,192 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-10 22:44:40,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:40,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:40,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:40,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:40,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:40,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:40,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:40,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:40,217 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-10 22:44:40,217 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:44:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:40,219 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:40,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-10 22:44:40,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:40,230 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:40,230 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:40,230 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-10 22:44:40,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-11-10 22:44:40,305 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-11-10 22:44:40,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:40,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:40,307 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:40,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 22:44:40,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:40,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:40,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:40,571 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-10 22:44:40,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:40,593 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 121 transitions. Complement of second has 4 states. [2024-11-10 22:44:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:40,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 86 letters. Loop has 2 letters. [2024-11-10 22:44:40,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:40,594 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:40,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 22:44:40,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:40,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:40,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:40,880 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-10 22:44:40,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:40,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 121 transitions. Complement of second has 4 states. [2024-11-10 22:44:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:40,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 86 letters. Loop has 2 letters. [2024-11-10 22:44:40,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:40,908 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:40,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 22:44:40,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:41,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:41,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:41,196 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-11-10 22:44:41,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:41,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 119 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 123 states and 154 transitions. Complement of second has 24 states. [2024-11-10 22:44:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2024-11-10 22:44:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 86 letters. Loop has 2 letters. [2024-11-10 22:44:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 88 letters. Loop has 2 letters. [2024-11-10 22:44:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 86 letters. Loop has 4 letters. [2024-11-10 22:44:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:41,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2024-11-10 22:44:41,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:41,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 117 states and 146 transitions. [2024-11-10 22:44:41,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:41,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:41,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 146 transitions. [2024-11-10 22:44:41,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:41,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 146 transitions. [2024-11-10 22:44:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 146 transitions. [2024-11-10 22:44:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2024-11-10 22:44:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.2) internal successors, (126), 104 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2024-11-10 22:44:41,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-11-10 22:44:41,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-11-10 22:44:41,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-10 22:44:41,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 126 transitions. [2024-11-10 22:44:41,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:41,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:41,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:41,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:41,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:41,421 INFO L745 eck$LassoCheckResult]: Stem: 11926#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11927#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11938#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 11930#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11931#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11943#L519 assume true; 11942#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11932#L521 assume !(main_~val~0#1 < 0); 11933#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11934#L519 assume true; 11944#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11978#L521 assume !(main_~val~0#1 < 0); 11977#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11976#L519 assume true; 11975#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11974#L521 assume !(main_~val~0#1 < 0); 11973#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11972#L519 assume true; 11971#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11970#L521 assume !(main_~val~0#1 < 0); 11969#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11968#L519 assume true; 11967#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11966#L521 assume !(main_~val~0#1 < 0); 11965#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11964#L519 assume true; 11963#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11962#L521 assume !(main_~val~0#1 < 0); 11961#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11960#L519 assume true; 11959#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11958#L521 assume !(main_~val~0#1 < 0); 11957#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11956#L519 assume true; 11955#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11954#L521 assume !(main_~val~0#1 < 0); 11953#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11952#L519 assume true; 11948#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11951#L521 assume !(main_~val~0#1 < 0); 11949#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11947#L519 assume true; 11941#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 11928#L526-3 main_~j~0#1 := 0; 11929#L526 assume true; 11936#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12023#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12022#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12021#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11937#L526 assume true; 11922#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 11923#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11935#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11939#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11940#L526 assume true; 12020#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12018#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12017#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12016#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12015#L526 assume true; 12014#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12012#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12011#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12010#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12009#L526 assume true; 12008#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12006#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12005#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12004#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12003#L526 assume true; 12002#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12000#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11999#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11998#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11997#L526 assume true; 11996#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 11994#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11993#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11992#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11991#L526 assume true; 11990#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 11988#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11987#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11986#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11985#L526 assume true; 11984#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 11983#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11979#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11950#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11945#L526 assume true; 11920#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 11921#L527 [2024-11-10 22:44:41,421 INFO L747 eck$LassoCheckResult]: Loop: 11921#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11924#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 11921#L527 [2024-11-10 22:44:41,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1723855175, now seen corresponding path program 18 times [2024-11-10 22:44:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618572014] [2024-11-10 22:44:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:41,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-11-10 22:44:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 156 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618572014] [2024-11-10 22:44:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618572014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625992528] [2024-11-10 22:44:41,869 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 22:44:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:41,871 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:41,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2024-11-10 22:44:42,105 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-10 22:44:42,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:42,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 22:44:42,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 198 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:42,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 198 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625992528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:42,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-11-10 22:44:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412411164] [2024-11-10 22:44:42,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:42,676 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:42,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 19 times [2024-11-10 22:44:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844038772] [2024-11-10 22:44:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 22:44:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 22:44:42,720 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. cyclomatic complexity: 33 Second operand has 35 states, 34 states have (on average 4.411764705882353) internal successors, (150), 35 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:42,932 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2024-11-10 22:44:42,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 203 transitions. [2024-11-10 22:44:42,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:42,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 112 states and 135 transitions. [2024-11-10 22:44:42,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:42,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:42,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 135 transitions. [2024-11-10 22:44:42,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:42,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 135 transitions. [2024-11-10 22:44:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 135 transitions. [2024-11-10 22:44:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-10 22:44:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.201834862385321) internal successors, (131), 108 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2024-11-10 22:44:42,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 131 transitions. [2024-11-10 22:44:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 22:44:42,937 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 131 transitions. [2024-11-10 22:44:42,937 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-10 22:44:42,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 131 transitions. [2024-11-10 22:44:42,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:42,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:42,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:42,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:42,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:42,939 INFO L745 eck$LassoCheckResult]: Stem: 12778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12779#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 12794#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 12784#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12785#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 12796#L519 assume true; 12798#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12786#L521 assume !(main_~val~0#1 < 0); 12787#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12788#L519 assume true; 12799#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12882#L521 assume !(main_~val~0#1 < 0); 12881#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12880#L519 assume true; 12879#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12878#L521 assume !(main_~val~0#1 < 0); 12877#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12876#L519 assume true; 12875#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12874#L521 assume !(main_~val~0#1 < 0); 12873#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12872#L519 assume true; 12871#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12870#L521 assume !(main_~val~0#1 < 0); 12869#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12868#L519 assume true; 12867#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12866#L521 assume !(main_~val~0#1 < 0); 12865#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12864#L519 assume true; 12863#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12862#L521 assume !(main_~val~0#1 < 0); 12861#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12860#L519 assume true; 12859#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12858#L521 assume !(main_~val~0#1 < 0); 12857#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12856#L519 assume true; 12855#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12854#L521 assume !(main_~val~0#1 < 0); 12853#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12852#L519 assume true; 12805#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12809#L521 assume !(main_~val~0#1 < 0); 12806#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12804#L519 assume true; 12797#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 12782#L526-3 main_~j~0#1 := 0; 12783#L526 assume true; 12792#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12789#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12790#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12795#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12793#L526 assume true; 12776#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12777#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12851#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12850#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12849#L526 assume true; 12848#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12846#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12845#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12844#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12843#L526 assume true; 12842#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12840#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12839#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12838#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12837#L526 assume true; 12836#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12834#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12833#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12832#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12831#L526 assume true; 12830#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12828#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12827#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12826#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12825#L526 assume true; 12824#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12822#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12821#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12820#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12819#L526 assume true; 12818#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12816#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12815#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12814#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12813#L526 assume true; 12812#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12811#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12803#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12802#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12800#L526 assume true; 12774#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 12775#L527 [2024-11-10 22:44:42,939 INFO L747 eck$LassoCheckResult]: Loop: 12775#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12780#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 12775#L527 [2024-11-10 22:44:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash -704973610, now seen corresponding path program 19 times [2024-11-10 22:44:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21559941] [2024-11-10 22:44:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:42,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 20 times [2024-11-10 22:44:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941474557] [2024-11-10 22:44:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:42,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:42,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1125193845, now seen corresponding path program 9 times [2024-11-10 22:44:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:42,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859736431] [2024-11-10 22:44:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:43,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:43,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:48,610 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:44:48,610 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:44:48,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:44:48,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:44:48,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:44:48,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:48,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:44:48,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:44:48,611 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration25_Lasso [2024-11-10 22:44:48,611 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:44:48,611 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:44:48,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:48,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:49,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:44:49,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:44:49,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:44:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,658 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-10 22:44:49,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:49,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:49,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-10 22:44:49,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,686 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-10 22:44:49,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-11-10 22:44:49,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,711 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-11-10 22:44:49,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:49,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:49,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-11-10 22:44:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,737 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-11-10 22:44:49,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-11-10 22:44:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,762 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-11-10 22:44:49,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-11-10 22:44:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,786 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-11-10 22:44:49,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-11-10 22:44:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,810 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-11-10 22:44:49,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-11-10 22:44:49,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,834 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-11-10 22:44:49,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-11-10 22:44:49,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,860 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-11-10 22:44:49,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-11-10 22:44:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,885 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-11-10 22:44:49,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-11-10 22:44:49,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,909 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-10 22:44:49,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-10 22:44:49,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,934 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-11-10 22:44:49,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:49,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:49,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-11-10 22:44:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,961 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-10 22:44:49,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:44:49,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:44:49,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:44:49,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:49,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-11-10 22:44:49,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:49,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:49,985 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:49,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-10 22:44:49,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:49,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:49,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:49,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:49,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:49,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:49,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-10 22:44:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,014 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-11-10 22:44:50,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2024-11-10 22:44:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,043 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-11-10 22:44:50,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-11-10 22:44:50,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,072 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-11-10 22:44:50,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-11-10 22:44:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,106 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-11-10 22:44:50,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-11-10 22:44:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,135 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-11-10 22:44:50,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-11-10 22:44:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,164 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-11-10 22:44:50,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-11-10 22:44:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,191 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-11-10 22:44:50,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-11-10 22:44:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,219 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-11-10 22:44:50,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-11-10 22:44:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,250 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-11-10 22:44:50,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,283 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-10 22:44:50,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-11-10 22:44:50,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,311 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-10 22:44:50,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:44:50,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-11-10 22:44:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,343 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-10 22:44:50,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:44:50,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:44:50,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:44:50,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:44:50,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:44:50,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:44:50,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:44:50,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:44:50,372 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-10 22:44:50,372 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-10 22:44:50,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:44:50,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:50,374 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:44:50,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-10 22:44:50,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:44:50,385 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:44:50,386 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:44:50,386 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 36))_1 Supporting invariants [] [2024-11-10 22:44:50,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:50,416 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-10 22:44:50,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:44:50,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:44:50,418 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:44:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:50,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 22:44:50,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:50,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:50,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:50,728 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2024-11-10 22:44:50,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34 Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:50,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 110 states and 133 transitions. Complement of second has 4 states. [2024-11-10 22:44:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:50,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 95 letters. Loop has 2 letters. [2024-11-10 22:44:50,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:50,760 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:50,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 22:44:50,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:51,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-11-10 22:44:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:51,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:51,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:51,133 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2024-11-10 22:44:51,134 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34 Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:51,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 110 states and 133 transitions. Complement of second has 4 states. [2024-11-10 22:44:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:44:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:44:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 95 letters. Loop has 2 letters. [2024-11-10 22:44:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:51,164 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:44:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:51,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 22:44:51,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:51,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:44:51,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:51,530 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2024-11-10 22:44:51,530 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34 Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:51,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 131 transitions. cyclomatic complexity: 34. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 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 134 states and 168 transitions. Complement of second has 26 states. [2024-11-10 22:44:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:44:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2024-11-10 22:44:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 92 transitions. Stem has 95 letters. Loop has 2 letters. [2024-11-10 22:44:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 92 transitions. Stem has 97 letters. Loop has 2 letters. [2024-11-10 22:44:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 92 transitions. Stem has 95 letters. Loop has 4 letters. [2024-11-10 22:44:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:44:51,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 168 transitions. [2024-11-10 22:44:51,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:51,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 128 states and 160 transitions. [2024-11-10 22:44:51,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:44:51,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:44:51,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 160 transitions. [2024-11-10 22:44:51,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:51,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 160 transitions. [2024-11-10 22:44:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 160 transitions. [2024-11-10 22:44:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2024-11-10 22:44:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2) internal successors, (138), 114 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2024-11-10 22:44:51,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 138 transitions. [2024-11-10 22:44:51,835 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 138 transitions. [2024-11-10 22:44:51,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-10 22:44:51,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 138 transitions. [2024-11-10 22:44:51,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:51,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:51,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:51,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:51,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:51,837 INFO L745 eck$LassoCheckResult]: Stem: 14269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14270#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 14283#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 14275#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 14276#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 14286#L519 assume true; 14288#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14277#L521 assume !(main_~val~0#1 < 0); 14278#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14279#L519 assume true; 14289#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14327#L521 assume !(main_~val~0#1 < 0); 14326#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14325#L519 assume true; 14324#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14323#L521 assume !(main_~val~0#1 < 0); 14322#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14321#L519 assume true; 14320#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14319#L521 assume !(main_~val~0#1 < 0); 14318#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14317#L519 assume true; 14316#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14315#L521 assume !(main_~val~0#1 < 0); 14314#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14313#L519 assume true; 14312#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14311#L521 assume !(main_~val~0#1 < 0); 14310#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14309#L519 assume true; 14308#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14307#L521 assume !(main_~val~0#1 < 0); 14306#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14305#L519 assume true; 14304#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14303#L521 assume !(main_~val~0#1 < 0); 14302#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14301#L519 assume true; 14300#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14299#L521 assume !(main_~val~0#1 < 0); 14298#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14297#L519 assume true; 14293#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14296#L521 assume !(main_~val~0#1 < 0); 14295#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 14292#L519 assume true; 14287#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 14273#L526-3 main_~j~0#1 := 0; 14274#L526 assume true; 14281#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14378#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14377#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14376#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14282#L526 assume true; 14267#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14268#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14280#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14284#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14285#L526 assume true; 14375#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14373#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14372#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14371#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14370#L526 assume true; 14369#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14367#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14366#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14365#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14364#L526 assume true; 14363#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14361#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14360#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14359#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14358#L526 assume true; 14357#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14355#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14354#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14353#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14352#L526 assume true; 14351#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14349#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14348#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14347#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14346#L526 assume true; 14345#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14343#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14342#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14341#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14340#L526 assume true; 14339#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14337#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14336#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14335#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14334#L526 assume true; 14333#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14332#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14328#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 14294#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14290#L526 assume true; 14265#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 14266#L527 [2024-11-10 22:44:51,837 INFO L747 eck$LassoCheckResult]: Loop: 14266#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 14271#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 14266#L527 [2024-11-10 22:44:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1569964208, now seen corresponding path program 20 times [2024-11-10 22:44:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171828784] [2024-11-10 22:44:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:44:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 198 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:44:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171828784] [2024-11-10 22:44:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171828784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:44:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98734873] [2024-11-10 22:44:52,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:44:52,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:44:52,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:44:52,264 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:44:52,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2024-11-10 22:44:52,388 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:44:52,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:44:52,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:44:52,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:44:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 245 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:52,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:44:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 245 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:44:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98734873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:44:53,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:44:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-11-10 22:44:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787172567] [2024-11-10 22:44:53,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:44:53,176 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:44:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 21 times [2024-11-10 22:44:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752205514] [2024-11-10 22:44:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:44:53,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 22:44:53,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 22:44:53,224 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. cyclomatic complexity: 36 Second operand has 38 states, 37 states have (on average 4.4324324324324325) internal successors, (164), 38 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:44:53,416 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2024-11-10 22:44:53,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 222 transitions. [2024-11-10 22:44:53,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:53,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 122 states and 147 transitions. [2024-11-10 22:44:53,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:44:53,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:44:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 147 transitions. [2024-11-10 22:44:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:44:53,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-10 22:44:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 147 transitions. [2024-11-10 22:44:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-10 22:44:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 118 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:44:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-11-10 22:44:53,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-11-10 22:44:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 22:44:53,422 INFO L425 stractBuchiCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-11-10 22:44:53,422 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-10 22:44:53,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 143 transitions. [2024-11-10 22:44:53,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:44:53,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:44:53,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:44:53,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:44:53,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:44:53,423 INFO L745 eck$LassoCheckResult]: Stem: 15208#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15209#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15220#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 15212#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15213#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15222#L519 assume true; 15224#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15214#L521 assume !(main_~val~0#1 < 0); 15215#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15217#L519 assume true; 15225#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15320#L521 assume !(main_~val~0#1 < 0); 15319#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15318#L519 assume true; 15317#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15316#L521 assume !(main_~val~0#1 < 0); 15315#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15314#L519 assume true; 15313#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15312#L521 assume !(main_~val~0#1 < 0); 15311#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15310#L519 assume true; 15309#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15308#L521 assume !(main_~val~0#1 < 0); 15307#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15306#L519 assume true; 15305#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15304#L521 assume !(main_~val~0#1 < 0); 15303#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15302#L519 assume true; 15301#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15300#L521 assume !(main_~val~0#1 < 0); 15299#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15298#L519 assume true; 15297#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15296#L521 assume !(main_~val~0#1 < 0); 15295#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15294#L519 assume true; 15293#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15292#L521 assume !(main_~val~0#1 < 0); 15291#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15290#L519 assume true; 15289#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15288#L521 assume !(main_~val~0#1 < 0); 15287#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15286#L519 assume true; 15229#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15233#L521 assume !(main_~val~0#1 < 0); 15231#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15228#L519 assume true; 15223#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 15210#L526-3 main_~j~0#1 := 0; 15211#L526 assume true; 15204#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15205#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15216#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15221#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15218#L526 assume true; 15219#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15284#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15283#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15282#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15281#L526 assume true; 15280#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15278#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15277#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15276#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15275#L526 assume true; 15274#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15272#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15271#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15270#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15269#L526 assume true; 15268#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15266#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15265#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15264#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15263#L526 assume true; 15262#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15260#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15259#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15258#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15257#L526 assume true; 15256#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15254#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15253#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15252#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15251#L526 assume true; 15250#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15248#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15247#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15246#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15245#L526 assume true; 15244#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15242#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15241#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15240#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15239#L526 assume true; 15238#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15237#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15232#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15230#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15226#L526 assume true; 15202#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 15203#L527 [2024-11-10 22:44:53,424 INFO L747 eck$LassoCheckResult]: Loop: 15203#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15206#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15203#L527 [2024-11-10 22:44:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1092228653, now seen corresponding path program 21 times [2024-11-10 22:44:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776752975] [2024-11-10 22:44:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 22 times [2024-11-10 22:44:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37793460] [2024-11-10 22:44:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:44:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:44:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1659715022, now seen corresponding path program 10 times [2024-11-10 22:44:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:44:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504926335] [2024-11-10 22:44:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:44:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:44:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:44:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:44:53,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:00,901 WARN L286 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 359 DAG size of output: 263 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 22:45:02,198 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:02,198 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:02,198 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:02,198 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:02,198 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:02,198 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:02,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:02,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:02,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration27_Lasso [2024-11-10 22:45:02,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:02,198 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:02,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:02,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:03,576 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:03,577 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,578 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-11-10 22:45:03,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2024-11-10 22:45:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,605 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-11-10 22:45:03,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2024-11-10 22:45:03,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,637 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-11-10 22:45:03,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2024-11-10 22:45:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,667 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-11-10 22:45:03,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2024-11-10 22:45:03,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,694 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-11-10 22:45:03,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2024-11-10 22:45:03,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,722 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-11-10 22:45:03,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:03,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,759 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-11-10 22:45:03,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:03,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2024-11-10 22:45:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,786 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-11-10 22:45:03,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:03,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:03,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:03,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:03,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:03,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:03,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:03,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:03,810 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-10 22:45:03,810 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-10 22:45:03,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,812 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-11-10 22:45:03,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:03,823 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:03,823 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:03,823 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 40 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 40 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-11-10 22:45:03,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:03,855 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2024-11-10 22:45:03,857 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-10 22:45:03,857 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-10 22:45:03,857 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-10 22:45:03,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:03,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:45:03,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:04,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:04,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:04,189 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-10 22:45:04,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37 Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:04,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 120 states and 145 transitions. Complement of second has 4 states. [2024-11-10 22:45:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:45:04,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 104 letters. Loop has 2 letters. [2024-11-10 22:45:04,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:04,222 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:04,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:45:04,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:04,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:04,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:04,577 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-10 22:45:04,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37 Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:04,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 120 states and 145 transitions. Complement of second has 4 states. [2024-11-10 22:45:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 22:45:04,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 104 letters. Loop has 2 letters. [2024-11-10 22:45:04,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:04,611 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:04,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:45:04,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:05,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:45:05,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:05,024 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-11-10 22:45:05,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37 Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:05,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 143 transitions. cyclomatic complexity: 37. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 145 states and 182 transitions. Complement of second has 28 states. [2024-11-10 22:45:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-10 22:45:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2024-11-10 22:45:05,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 99 transitions. Stem has 104 letters. Loop has 2 letters. [2024-11-10 22:45:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 99 transitions. Stem has 106 letters. Loop has 2 letters. [2024-11-10 22:45:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 99 transitions. Stem has 104 letters. Loop has 4 letters. [2024-11-10 22:45:05,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 182 transitions. [2024-11-10 22:45:05,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:45:05,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 174 transitions. [2024-11-10 22:45:05,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 22:45:05,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:45:05,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 174 transitions. [2024-11-10 22:45:05,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:05,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 174 transitions. [2024-11-10 22:45:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 174 transitions. [2024-11-10 22:45:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2024-11-10 22:45:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.2) internal successors, (150), 124 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2024-11-10 22:45:05,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 150 transitions. [2024-11-10 22:45:05,302 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 150 transitions. [2024-11-10 22:45:05,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-10 22:45:05,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 150 transitions. [2024-11-10 22:45:05,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:45:05,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:05,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:05,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:05,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:45:05,304 INFO L745 eck$LassoCheckResult]: Stem: 16831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16832#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 16843#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 16835#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 16836#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 16848#L519 assume true; 16847#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16837#L521 assume !(main_~val~0#1 < 0); 16838#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16839#L519 assume true; 16849#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16891#L521 assume !(main_~val~0#1 < 0); 16890#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16889#L519 assume true; 16888#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16887#L521 assume !(main_~val~0#1 < 0); 16886#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16885#L519 assume true; 16884#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16883#L521 assume !(main_~val~0#1 < 0); 16882#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16881#L519 assume true; 16880#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16879#L521 assume !(main_~val~0#1 < 0); 16878#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16877#L519 assume true; 16876#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16875#L521 assume !(main_~val~0#1 < 0); 16874#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16873#L519 assume true; 16872#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16871#L521 assume !(main_~val~0#1 < 0); 16870#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16869#L519 assume true; 16868#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16867#L521 assume !(main_~val~0#1 < 0); 16866#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16865#L519 assume true; 16864#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16863#L521 assume !(main_~val~0#1 < 0); 16862#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16861#L519 assume true; 16860#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16859#L521 assume !(main_~val~0#1 < 0); 16858#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16857#L519 assume true; 16853#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16856#L521 assume !(main_~val~0#1 < 0); 16854#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16852#L519 assume true; 16846#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 16833#L526-3 main_~j~0#1 := 0; 16834#L526 assume true; 16841#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16948#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16947#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16946#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16842#L526 assume true; 16827#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16828#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16840#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16844#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16845#L526 assume true; 16945#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16943#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16942#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16941#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16940#L526 assume true; 16939#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16937#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16936#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16935#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16934#L526 assume true; 16933#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16931#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16930#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16929#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16928#L526 assume true; 16927#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16925#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16924#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16923#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16922#L526 assume true; 16921#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16919#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16918#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16917#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16916#L526 assume true; 16915#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16913#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16912#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16911#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16910#L526 assume true; 16909#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16907#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16906#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16905#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16904#L526 assume true; 16903#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16901#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16900#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16899#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16898#L526 assume true; 16897#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16896#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16892#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16855#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16850#L526 assume true; 16825#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 16826#L527 [2024-11-10 22:45:05,304 INFO L747 eck$LassoCheckResult]: Loop: 16826#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16829#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 16826#L527 [2024-11-10 22:45:05,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -906764173, now seen corresponding path program 22 times [2024-11-10 22:45:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274834424] [2024-11-10 22:45:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:05,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 245 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274834424] [2024-11-10 22:45:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274834424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:45:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265377691] [2024-11-10 22:45:05,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:45:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:45:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,855 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process [2024-11-10 22:45:05,987 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:45:05,987 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:45:05,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 22:45:05,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 297 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:06,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:45:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 297 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265377691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:45:06,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:45:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-11-10 22:45:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649718095] [2024-11-10 22:45:06,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:45:06,793 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:45:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 23 times [2024-11-10 22:45:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877353301] [2024-11-10 22:45:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:06,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 22:45:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 22:45:06,826 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. cyclomatic complexity: 39 Second operand has 41 states, 40 states have (on average 4.45) internal successors, (178), 41 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:07,071 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2024-11-10 22:45:07,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 241 transitions. [2024-11-10 22:45:07,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:45:07,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 132 states and 159 transitions. [2024-11-10 22:45:07,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 22:45:07,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-10 22:45:07,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 159 transitions. [2024-11-10 22:45:07,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:07,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 159 transitions. [2024-11-10 22:45:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 159 transitions. [2024-11-10 22:45:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-11-10 22:45:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 128 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2024-11-10 22:45:07,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 155 transitions. [2024-11-10 22:45:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 22:45:07,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 155 transitions. [2024-11-10 22:45:07,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-10 22:45:07,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 155 transitions. [2024-11-10 22:45:07,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 22:45:07,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:07,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:07,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:07,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:45:07,078 INFO L745 eck$LassoCheckResult]: Stem: 17852#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17853#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 17864#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 17856#L517-1 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 17857#L518-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 17867#L519 assume true; 17868#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17973#L521 assume !(main_~val~0#1 < 0); 17972#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17869#L519 assume true; 17866#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17858#L521 assume !(main_~val~0#1 < 0); 17859#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17860#L519 assume true; 17971#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17970#L521 assume !(main_~val~0#1 < 0); 17969#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17968#L519 assume true; 17967#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17966#L521 assume !(main_~val~0#1 < 0); 17965#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17964#L519 assume true; 17963#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17962#L521 assume !(main_~val~0#1 < 0); 17961#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17960#L519 assume true; 17959#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17958#L521 assume !(main_~val~0#1 < 0); 17957#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17956#L519 assume true; 17955#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17954#L521 assume !(main_~val~0#1 < 0); 17953#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17952#L519 assume true; 17951#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17950#L521 assume !(main_~val~0#1 < 0); 17949#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17948#L519 assume true; 17947#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17946#L521 assume !(main_~val~0#1 < 0); 17945#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17944#L519 assume true; 17943#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17942#L521 assume !(main_~val~0#1 < 0); 17941#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17940#L519 assume true; 17939#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17938#L521 assume !(main_~val~0#1 < 0); 17937#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17936#L519 assume true; 17875#L519-1 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17879#L521 assume !(main_~val~0#1 < 0); 17876#L524 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 17874#L519 assume true; 17865#L519-1 assume !(main_~i~0#1 < main_~length~0#1); 17854#L526-3 main_~j~0#1 := 0; 17855#L526 assume true; 17847#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17848#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17850#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17851#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17862#L526 assume true; 17863#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17934#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17933#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17932#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17931#L526 assume true; 17930#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17928#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17927#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17926#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17925#L526 assume true; 17924#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17922#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17921#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17920#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17919#L526 assume true; 17918#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17916#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17915#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17914#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17913#L526 assume true; 17912#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17910#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17909#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17908#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17907#L526 assume true; 17906#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17904#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17903#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17902#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17901#L526 assume true; 17900#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17898#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17897#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17896#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17895#L526 assume true; 17894#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17892#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17891#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17890#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17889#L526 assume true; 17888#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17886#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17885#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17884#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17883#L526 assume true; 17882#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17881#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17873#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 17872#L526-1 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17870#L526 assume true; 17845#L526-2 assume !!(main_~j~0#1 < main_~length~0#1); 17846#L527 [2024-11-10 22:45:07,078 INFO L747 eck$LassoCheckResult]: Loop: 17846#L527 assume true;call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 17849#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 17846#L527 [2024-11-10 22:45:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1817074000, now seen corresponding path program 23 times [2024-11-10 22:45:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022094179] [2024-11-10 22:45:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 24 times [2024-11-10 22:45:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071067434] [2024-11-10 22:45:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1843575185, now seen corresponding path program 11 times [2024-11-10 22:45:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700374802] [2024-11-10 22:45:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace