./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array01-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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/array01-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:30:15,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:30:15,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:30:15,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:30:15,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:30:15,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:30:15,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:30:15,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:30:15,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:30:15,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:30:15,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:30:15,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:30:15,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:30:15,827 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:30:15,827 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:30:15,828 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:30:15,829 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:30:15,829 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:30:15,829 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:30:15,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:30:15,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:30:15,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:30:15,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:30:15,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:30:15,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:30:15,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:30:15,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:30:15,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:30:15,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:30:15,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:30:15,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:30:15,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:30:15,832 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:30:15,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:30:15,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:30:15,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:30:15,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:30:15,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:30:15,838 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:30:15,838 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 -> c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 [2024-11-09 15:30:16,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:30:16,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:30:16,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:30:16,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:30:16,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:30:16,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2024-11-09 15:30:17,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:30:17,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:30:17,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2024-11-09 15:30:17,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e809f9d9/286e01c38db34f7580b1906bcf23d2ad/FLAGf70ae32dd [2024-11-09 15:30:17,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e809f9d9/286e01c38db34f7580b1906bcf23d2ad [2024-11-09 15:30:17,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:30:17,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:30:17,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:30:17,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:30:17,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:30:17,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f46807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17, skipping insertion in model container [2024-11-09 15:30:17,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:30:17,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:30:17,885 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:30:17,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:30:17,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:30:17,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17 WrapperNode [2024-11-09 15:30:17,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:30:17,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:30:17,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:30:17,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:30:17,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,974 INFO L138 Inliner]: procedures = 116, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-11-09 15:30:17,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:30:17,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:30:17,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:30:17,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:30:17,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:17,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,004 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-09 15:30:18,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:30:18,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:30:18,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:30:18,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:30:18,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (1/1) ... [2024-11-09 15:30:18,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:18,049 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-09 15:30:18,057 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-09 15:30:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:30:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:30:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:30:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:30:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:30:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:30:18,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:30:18,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:30:18,292 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 15:30:18,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:30:18,307 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:30:18,307 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 15:30:18,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:30:18 BoogieIcfgContainer [2024-11-09 15:30:18,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:30:18,309 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:30:18,310 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:30:18,315 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:30:18,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:18,316 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:30:17" (1/3) ... [2024-11-09 15:30:18,316 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6caa84b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:30:18, skipping insertion in model container [2024-11-09 15:30:18,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:18,317 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:17" (2/3) ... [2024-11-09 15:30:18,317 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6caa84b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:30:18, skipping insertion in model container [2024-11-09 15:30:18,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:18,318 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:30:18" (3/3) ... [2024-11-09 15:30:18,318 INFO L332 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2024-11-09 15:30:18,362 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:30:18,362 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:30:18,362 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:30:18,362 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:30:18,363 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:30:18,363 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:30:18,363 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:30:18,363 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:30:18,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-09 15:30:18,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-09 15:30:18,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:18,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:18,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:30:18,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:18,385 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:30:18,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-09 15:30:18,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-09 15:30:18,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:18,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:18,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:30:18,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:18,393 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11#L526true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3#L526-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 4#L531-3true [2024-11-09 15:30:18,393 INFO L747 eck$LassoCheckResult]: Loop: 4#L531-3true assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12#L531-2true main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4#L531-3true [2024-11-09 15:30:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-09 15:30:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625544364] [2024-11-09 15:30:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:18,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-11-09 15:30:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362817107] [2024-11-09 15:30:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:18,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-11-09 15:30:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897436334] [2024-11-09 15:30:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:18,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:18,777 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:18,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:18,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:18,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:18,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:18,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:18,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:18,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:18,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2024-11-09 15:30:18,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:18,778 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:18,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:18,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,207 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:19,210 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,213 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-09 15:30:19,215 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-09 15:30:19,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:19,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:19,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:19,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,241 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-09 15:30:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,243 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-09 15:30:19,245 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-09 15:30:19,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:19,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,273 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-09 15:30:19,274 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-09 15:30:19,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:19,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:19,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:19,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,298 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-09 15:30:19,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,299 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-09 15:30:19,300 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-09 15:30:19,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:30:19,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,330 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-09 15:30:19,332 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-09 15:30:19,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,366 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-09 15:30:19,367 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-09 15:30:19,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,414 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-09 15:30:19,416 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-09 15:30:19,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:19,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:19,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,448 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-09 15:30:19,451 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-09 15:30:19,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:19,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:19,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:19,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:19,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:19,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:19,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:19,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:19,521 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-09 15:30:19,521 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-09 15:30:19,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:19,524 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-09 15:30:19,525 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-09 15:30:19,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:19,538 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:30:19,538 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:19,538 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1, ULTIMATE.start_main_~k~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 - 4*ULTIMATE.start_main_~k~0#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2024-11-09 15:30:19,549 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-09 15:30:19,563 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:30:19,576 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:30:19,576 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:30:19,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:19,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:30:19,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:19,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:30:19,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:19,663 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-09 15:30:19,694 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-09 15:30:19,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:19,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 40 transitions. Complement of second has 6 states. [2024-11-09 15:30:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:30:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2024-11-09 15:30:19,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:30:19,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:19,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:30:19,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:19,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:30:19,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:19,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2024-11-09 15:30:19,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:19,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions. [2024-11-09 15:30:19,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:19,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:30:19,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-11-09 15:30:19,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:19,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:30:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-11-09 15:30:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:30:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-11-09 15:30:19,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:30:19,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-11-09 15:30:19,838 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:30:19,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-11-09 15:30:19,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:19,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:19,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:19,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:30:19,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:30:19,839 INFO L745 eck$LassoCheckResult]: Stem: 115#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 112#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 111#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 107#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 109#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 113#L516-3 [2024-11-09 15:30:19,840 INFO L747 eck$LassoCheckResult]: Loop: 113#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 114#L517-3 assume !true; 117#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 113#L516-3 [2024-11-09 15:30:19,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-11-09 15:30:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421051771] [2024-11-09 15:30:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:19,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-09 15:30:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:19,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421051771] [2024-11-09 15:30:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421051771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:30:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:30:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471440028] [2024-11-09 15:30:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:19,936 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash 60960, now seen corresponding path program 1 times [2024-11-09 15:30:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493196816] [2024-11-09 15:30:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:19,946 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-09 15:30:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493196816] [2024-11-09 15:30:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493196816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:30:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:30:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978298642] [2024-11-09 15:30:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:19,947 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:30:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:19,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:30:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:30:19,950 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:19,954 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2024-11-09 15:30:19,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2024-11-09 15:30:19,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:19,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2024-11-09 15:30:19,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:19,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:30:19,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2024-11-09 15:30:19,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:19,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 15:30:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2024-11-09 15:30:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 15:30:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-09 15:30:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-11-09 15:30:19,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 15:30:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:30:19,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-11-09 15:30:19,957 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:30:19,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-11-09 15:30:19,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:19,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:19,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:19,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:30:19,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:30:19,958 INFO L745 eck$LassoCheckResult]: Stem: 146#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 143#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 138#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 139#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 141#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 144#L516-3 [2024-11-09 15:30:19,959 INFO L747 eck$LassoCheckResult]: Loop: 144#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 145#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 149#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 148#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 144#L516-3 [2024-11-09 15:30:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-11-09 15:30:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808435291] [2024-11-09 15:30:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:20,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-09 15:30:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808435291] [2024-11-09 15:30:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808435291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:30:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:30:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470425516] [2024-11-09 15:30:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:20,026 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:20,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2024-11-09 15:30:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881889738] [2024-11-09 15:30:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:20,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:30:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:30:20,067 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:20,080 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-11-09 15:30:20,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-11-09 15:30:20,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:20,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-11-09 15:30:20,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:20,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:30:20,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-09 15:30:20,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:20,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-09 15:30:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-09 15:30:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-09 15:30:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-09 15:30:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-11-09 15:30:20,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:30:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:30:20,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-11-09 15:30:20,087 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:30:20,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-11-09 15:30:20,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-09 15:30:20,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:20,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:20,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:20,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:30:20,088 INFO L745 eck$LassoCheckResult]: Stem: 178#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 175#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 170#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 171#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 172#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 173#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 174#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 176#L516-3 [2024-11-09 15:30:20,089 INFO L747 eck$LassoCheckResult]: Loop: 176#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 177#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 181#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 180#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 176#L516-3 [2024-11-09 15:30:20,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-11-09 15:30:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163568612] [2024-11-09 15:30:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:20,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2024-11-09 15:30:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802462729] [2024-11-09 15:30:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:20,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2024-11-09 15:30:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:20,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103835408] [2024-11-09 15:30:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:20,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:20,336 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-09 15:30:20,384 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:20,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:20,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:20,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:20,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:20,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:20,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:20,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2024-11-09 15:30:20,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:20,385 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:20,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,664 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:20,664 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:20,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,668 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-09 15:30:20,669 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-09 15:30:20,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,695 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-09 15:30:20,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,700 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-09 15:30:20,701 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-09 15:30:20,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,730 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-09 15:30:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,734 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-09 15:30:20,735 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-09 15:30:20,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,760 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-09 15:30:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,764 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-09 15:30:20,765 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-09 15:30:20,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,789 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-09 15:30:20,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,793 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-09 15:30:20,794 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-09 15:30:20,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:20,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,820 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-09 15:30:20,821 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-09 15:30:20,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,848 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-09 15:30:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,851 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-09 15:30:20,852 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-09 15:30:20,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:30:20,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,879 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-09 15:30:20,880 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-09 15:30:20,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,903 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-09 15:30:20,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,905 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-09 15:30:20,906 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-09 15:30:20,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:30:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,931 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-09 15:30:20,933 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-09 15:30:20,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:30:20,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,962 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-09 15:30:20,964 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-09 15:30:20,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:20,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,017 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-09 15:30:21,018 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-09 15:30:21,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:30:21,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,054 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-09 15:30:21,059 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-09 15:30:21,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,089 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-09 15:30:21,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,093 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-09 15:30:21,094 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-09 15:30:21,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,125 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-09 15:30:21,126 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-09 15:30:21,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:21,171 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-09 15:30:21,171 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-09 15:30:21,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,173 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-09 15:30:21,174 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-09 15:30:21,174 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:21,186 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:21,186 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:21,186 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2024-11-09 15:30:21,196 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-09 15:30:21,205 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:30:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:30:21,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:30:21,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:21,276 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-09 15:30:21,276 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-09 15:30:21,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 22 transitions. Complement of second has 4 states. [2024-11-09 15:30:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:30:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-09 15:30:21,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-09 15:30:21,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-09 15:30:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2024-11-09 15:30:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-11-09 15:30:21,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:21,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2024-11-09 15:30:21,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:21,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:30:21,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-11-09 15:30:21,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:21,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-11-09 15:30:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-11-09 15:30:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-09 15:30:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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-09 15:30:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-09 15:30:21,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:30:21,297 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-09 15:30:21,297 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:30:21,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-09 15:30:21,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:21,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:21,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:21,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:21,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:21,298 INFO L745 eck$LassoCheckResult]: Stem: 276#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 271#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 266#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 267#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 268#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 269#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 270#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 272#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 274#L517-3 [2024-11-09 15:30:21,299 INFO L747 eck$LassoCheckResult]: Loop: 274#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 279#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 274#L517-3 [2024-11-09 15:30:21,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2024-11-09 15:30:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811316959] [2024-11-09 15:30:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2024-11-09 15:30:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902160042] [2024-11-09 15:30:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:21,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2024-11-09 15:30:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44201777] [2024-11-09 15:30:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:21,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,635 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:21,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:21,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:21,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:21,636 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:21,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:21,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:21,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration5_Lasso [2024-11-09 15:30:21,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:21,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:21,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:21,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:21,913 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,915 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-09 15:30:21,916 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-09 15:30:21,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-09 15:30:21,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,940 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-09 15:30:21,941 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-09 15:30:21,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,967 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-09 15:30:21,968 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-09 15:30:21,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:21,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,989 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-09 15:30:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,991 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-09 15:30:21,992 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-09 15:30:21,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:22,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:22,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:22,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:22,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:22,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:22,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:22,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:22,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:22,017 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-09 15:30:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,021 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-09 15:30:22,022 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-09 15:30:22,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:22,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:22,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:22,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:22,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:22,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:22,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:22,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:22,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,050 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-09 15:30:22,054 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-09 15:30:22,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:22,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:22,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:22,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:22,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:22,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:22,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:22,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:22,082 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-09 15:30:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,084 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-09 15:30:22,085 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-09 15:30:22,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:22,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:22,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:22,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:22,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:22,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:22,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:22,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:22,111 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-09 15:30:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,114 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-09 15:30:22,114 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-09 15:30:22,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:22,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:22,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:22,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:22,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:22,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:22,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:22,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:22,140 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:30:22,140 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:30:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,142 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-09 15:30:22,147 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-09 15:30:22,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:22,158 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:22,158 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:22,158 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2 Supporting invariants [] [2024-11-09 15:30:22,169 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-09 15:30:22,175 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:30:22,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:22,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:22,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:22,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:22,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:30:22,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:22,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:22,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:22,248 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-09 15:30:22,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-09 15:30:22,249 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:22,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 9 states. [2024-11-09 15:30:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:30:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-11-09 15:30:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2024-11-09 15:30:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2024-11-09 15:30:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-09 15:30:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:22,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-09 15:30:22,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:22,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2024-11-09 15:30:22,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:22,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:22,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2024-11-09 15:30:22,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:22,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-11-09 15:30:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2024-11-09 15:30:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 15:30:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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-09 15:30:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-09 15:30:22,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-09 15:30:22,289 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-09 15:30:22,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:30:22,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-11-09 15:30:22,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:22,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:22,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:22,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:22,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:22,290 INFO L745 eck$LassoCheckResult]: Stem: 398#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 392#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 391#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 387#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 388#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 389#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 390#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 393#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 394#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 402#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 400#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 395#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 397#L517-3 [2024-11-09 15:30:22,290 INFO L747 eck$LassoCheckResult]: Loop: 397#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 401#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 397#L517-3 [2024-11-09 15:30:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2024-11-09 15:30:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422687362] [2024-11-09 15:30:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:22,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422687362] [2024-11-09 15:30:22,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422687362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:22,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494674510] [2024-11-09 15:30:22,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:30:22,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:22,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,403 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:22,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 15:30:22,452 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:30:22,452 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:22,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:30:22,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:22,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494674510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:22,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 15:30:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025872540] [2024-11-09 15:30:22,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:22,531 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:22,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2024-11-09 15:30:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403655441] [2024-11-09 15:30:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:22,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 15:30:22,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 15:30:22,598 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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-09 15:30:22,608 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-09 15:30:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:22,672 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-09 15:30:22,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-09 15:30:22,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:22,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2024-11-09 15:30:22,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:22,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:22,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-11-09 15:30:22,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:22,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 15:30:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-11-09 15:30:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 15:30:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-09 15:30:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-09 15:30:22,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-09 15:30:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:30:22,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-09 15:30:22,676 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:30:22,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-11-09 15:30:22,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:22,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:22,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:22,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:22,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:22,677 INFO L745 eck$LassoCheckResult]: Stem: 541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 535#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 534#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 530#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 531#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 532#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 533#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 548#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 543#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 536#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 537#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 549#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 544#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 538#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 540#L517-3 [2024-11-09 15:30:22,677 INFO L747 eck$LassoCheckResult]: Loop: 540#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 545#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 540#L517-3 [2024-11-09 15:30:22,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2024-11-09 15:30:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787312556] [2024-11-09 15:30:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2024-11-09 15:30:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790752496] [2024-11-09 15:30:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2024-11-09 15:30:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926603580] [2024-11-09 15:30:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,985 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:22,985 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:22,985 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:22,985 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:22,986 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:22,986 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:22,986 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:22,986 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:22,986 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration7_Lasso [2024-11-09 15:30:22,986 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:22,986 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:22,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:22,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:23,301 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:23,301 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,303 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-09 15:30:23,310 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-09 15:30:23,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-09 15:30:23,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:23,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:23,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:23,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:23,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:23,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:23,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:23,337 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-09 15:30:23,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,339 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-09 15:30:23,340 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-09 15:30:23,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:23,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:23,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:23,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:23,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:23,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:23,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:23,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:23,366 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-09 15:30:23,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,369 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-09 15:30:23,370 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-09 15:30:23,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:23,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:23,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:23,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:23,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:23,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:23,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:23,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:23,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,398 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-09 15:30:23,399 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-09 15:30:23,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:23,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:23,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:23,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:23,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:23,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:23,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:23,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:23,427 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-09 15:30:23,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,432 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-09 15:30:23,433 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-09 15:30:23,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-09 15:30:23,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:23,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:23,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:23,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:23,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:23,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:23,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:23,461 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:30:23,461 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:30:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:23,463 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-09 15:30:23,464 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-09 15:30:23,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:23,476 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:23,476 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:23,476 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 4)_1 Supporting invariants [] [2024-11-09 15:30:23,487 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-09 15:30:23,496 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:30:23,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:23,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:23,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:23,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:23,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:23,577 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-09 15:30:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:23,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:23,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-09 15:30:23,713 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-09 15:30:23,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:23,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 21 states and 26 transitions. Complement of second has 5 states. [2024-11-09 15:30:23,735 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-09 15:30:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:23,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-09 15:30:23,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:23,736 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:23,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:23,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:23,893 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-09 15:30:23,893 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-09 15:30:23,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:23,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 21 states and 26 transitions. Complement of second has 5 states. [2024-11-09 15:30:23,913 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-09 15:30:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:23,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-09 15:30:23,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:23,914 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:23,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:24,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:24,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:24,053 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-09 15:30:24,054 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-09 15:30:24,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:24,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 35 states and 43 transitions. Complement of second has 11 states. [2024-11-09 15:30:24,128 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-09 15:30:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-09 15:30:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2024-11-09 15:30:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-09 15:30:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-09 15:30:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-09 15:30:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:24,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-11-09 15:30:24,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:24,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2024-11-09 15:30:24,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:24,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:24,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2024-11-09 15:30:24,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:24,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-09 15:30:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2024-11-09 15:30:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-09 15:30:24,132 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-09 15:30:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-09 15:30:24,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-09 15:30:24,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-09 15:30:24,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:30:24,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-11-09 15:30:24,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:24,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:24,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:24,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:24,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:24,134 INFO L745 eck$LassoCheckResult]: Stem: 877#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 872#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 867#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 868#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 869#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 870#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 871#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 887#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 881#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 873#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 874#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 889#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 888#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 875#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 876#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 891#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 879#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 880#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 883#L517-3 [2024-11-09 15:30:24,134 INFO L747 eck$LassoCheckResult]: Loop: 883#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 882#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 883#L517-3 [2024-11-09 15:30:24,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1359773592, now seen corresponding path program 4 times [2024-11-09 15:30:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787347372] [2024-11-09 15:30:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:24,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:24,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787347372] [2024-11-09 15:30:24,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787347372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911021938] [2024-11-09 15:30:24,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:30:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:24,219 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:24,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-09 15:30:24,267 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:30:24,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:24,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:30:24,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:24,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911021938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:24,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 15:30:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50162564] [2024-11-09 15:30:24,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:24,373 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2024-11-09 15:30:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777959037] [2024-11-09 15:30:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:30:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:30:24,411 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 10 Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-09 15:30:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:24,461 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-09 15:30:24,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-11-09 15:30:24,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:24,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 33 transitions. [2024-11-09 15:30:24,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:24,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:24,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-11-09 15:30:24,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:24,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 15:30:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-11-09 15:30:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 15:30:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 15:30:24,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 15:30:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 15:30:24,465 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 15:30:24,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:30:24,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2024-11-09 15:30:24,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:24,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:24,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:24,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:24,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:24,466 INFO L745 eck$LassoCheckResult]: Stem: 1068#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1062#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1061#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1057#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1058#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1059#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1060#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1063#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1078#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1077#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1070#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1064#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1065#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1082#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1071#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1066#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1067#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1081#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1080#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1079#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1072#L517-3 [2024-11-09 15:30:24,466 INFO L747 eck$LassoCheckResult]: Loop: 1072#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1073#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1072#L517-3 [2024-11-09 15:30:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1255193994, now seen corresponding path program 5 times [2024-11-09 15:30:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110359329] [2024-11-09 15:30:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 5 times [2024-11-09 15:30:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481484590] [2024-11-09 15:30:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:24,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash 644383099, now seen corresponding path program 2 times [2024-11-09 15:30:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432448682] [2024-11-09 15:30:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:24,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:24,952 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:24,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:24,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:24,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:24,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:24,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:24,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:24,953 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:24,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration9_Lasso [2024-11-09 15:30:24,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:24,953 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:24,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:24,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:25,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:25,304 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:25,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,308 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:25,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:30:25,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-09 15:30:25,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:25,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:25,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:25,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,336 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:25,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:30:25,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:25,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:30:25,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,392 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-09 15:30:25,393 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-09 15:30:25,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:25,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,421 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-09 15:30:25,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,422 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-09 15:30:25,423 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-09 15:30:25,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:25,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,449 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-09 15:30:25,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,454 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-09 15:30:25,456 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-09 15:30:25,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:25,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,481 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-09 15:30:25,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,482 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-09 15:30:25,483 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-09 15:30:25,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:25,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:25,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:25,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,509 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-09 15:30:25,509 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-09 15:30:25,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:25,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:25,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:25,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:25,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:25,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:25,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:25,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:25,534 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:30:25,534 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:30:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:25,536 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-09 15:30:25,537 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-09 15:30:25,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:25,548 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:25,548 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:25,548 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 8)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 8)_1 Supporting invariants [] [2024-11-09 15:30:25,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:25,569 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2024-11-09 15:30:25,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:25,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:25,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:25,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:25,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:30:25,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:25,772 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-09 15:30:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:25,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:25,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:25,849 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-09 15:30:25,849 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-09 15:30:25,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:25,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 5 states. [2024-11-09 15:30:25,893 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-09 15:30:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:25,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:30:25,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:25,894 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:25,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:25,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:30:25,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:26,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:26,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:26,124 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-09 15:30:26,124 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-09 15:30:26,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:26,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 5 states. [2024-11-09 15:30:26,153 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-09 15:30:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:30:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:26,154 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:26,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:26,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:30:26,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:26,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:26,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:26,345 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-09 15:30:26,345 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-09 15:30:26,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:26,427 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 53 transitions. Complement of second has 13 states. [2024-11-09 15:30:26,428 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-09 15:30:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-11-09 15:30:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-09 15:30:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-09 15:30:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-09 15:30:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:26,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2024-11-09 15:30:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:26,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 46 transitions. [2024-11-09 15:30:26,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:26,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:26,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-11-09 15:30:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:26,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-09 15:30:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-11-09 15:30:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-11-09 15:30:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 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-09 15:30:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 15:30:26,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 15:30:26,432 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 15:30:26,432 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:30:26,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2024-11-09 15:30:26,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:26,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:26,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:26,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:26,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:26,434 INFO L745 eck$LassoCheckResult]: Stem: 1497#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1492#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1487#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1488#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1489#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1490#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1491#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1508#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1507#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1506#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1501#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1493#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1494#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1513#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1514#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1495#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1496#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1505#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1499#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1500#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1516#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1512#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1511#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1509#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1502#L517-3 [2024-11-09 15:30:26,434 INFO L747 eck$LassoCheckResult]: Loop: 1502#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1503#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1502#L517-3 [2024-11-09 15:30:26,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash 776867019, now seen corresponding path program 6 times [2024-11-09 15:30:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:26,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424058813] [2024-11-09 15:30:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:26,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424058813] [2024-11-09 15:30:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424058813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955879637] [2024-11-09 15:30:26,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:30:26,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:26,541 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:26,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-09 15:30:26,593 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-09 15:30:26,594 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:26,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:30:26,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:26,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955879637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:26,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-09 15:30:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184336107] [2024-11-09 15:30:26,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:26,747 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 6 times [2024-11-09 15:30:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740989471] [2024-11-09 15:30:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:26,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:30:26,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:30:26,787 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 12 Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 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-09 15:30:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:26,869 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-09 15:30:26,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2024-11-09 15:30:26,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:26,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 41 transitions. [2024-11-09 15:30:26,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:26,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:26,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2024-11-09 15:30:26,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:26,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 15:30:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2024-11-09 15:30:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-09 15:30:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 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-09 15:30:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-09 15:30:26,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-09 15:30:26,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:30:26,875 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-09 15:30:26,875 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:30:26,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2024-11-09 15:30:26,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:26,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:26,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:26,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:26,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:26,876 INFO L745 eck$LassoCheckResult]: Stem: 1746#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1740#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1735#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1736#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1737#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1738#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1739#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1741#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1761#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1760#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 1755#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1754#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1749#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1742#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1743#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1767#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1748#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1744#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1745#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1753#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1763#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1766#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1765#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1759#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1758#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1756#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1750#L517-3 [2024-11-09 15:30:26,876 INFO L747 eck$LassoCheckResult]: Loop: 1750#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1751#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1750#L517-3 [2024-11-09 15:30:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -914443991, now seen corresponding path program 7 times [2024-11-09 15:30:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095080383] [2024-11-09 15:30:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 7 times [2024-11-09 15:30:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891440371] [2024-11-09 15:30:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1687621486, now seen corresponding path program 3 times [2024-11-09 15:30:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:26,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437548842] [2024-11-09 15:30:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:26,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:27,422 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:27,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:27,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:27,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:27,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:27,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:27,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:27,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:27,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration11_Lasso [2024-11-09 15:30:27,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:27,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:27,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:27,925 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:27,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:27,927 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-09 15:30:27,928 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-09 15:30:27,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:27,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:27,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:27,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:27,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:27,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:27,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:27,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:27,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:27,951 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-09 15:30:27,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:27,953 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-09 15:30:27,953 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-09 15:30:27,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:27,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:27,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:27,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:27,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:27,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:27,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:27,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:27,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:27,976 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-09 15:30:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:27,977 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-09 15:30:27,978 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-09 15:30:27,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:27,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:27,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:27,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:27,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:27,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:27,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:27,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:27,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:27,999 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-09 15:30:28,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:28,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:28,001 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-09 15:30:28,002 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-09 15:30:28,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:28,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:28,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:28,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:28,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:28,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:28,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:28,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:28,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:28,029 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-09 15:30:28,030 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-09 15:30:28,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:28,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:28,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:28,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:28,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:28,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:28,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:28,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:28,058 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-09 15:30:28,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:28,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:28,059 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-09 15:30:28,060 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-09 15:30:28,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:28,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:28,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:28,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:28,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:28,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:28,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:28,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:28,087 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-09 15:30:28,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:28,089 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-09 15:30:28,089 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-09 15:30:28,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:28,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:28,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:28,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:28,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:28,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:28,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:28,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:28,115 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:30:28,115 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-09 15:30:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:28,117 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-09 15:30:28,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:28,129 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:28,129 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:28,129 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1 Supporting invariants [] [2024-11-09 15:30:28,143 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-09 15:30:28,171 INFO L156 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2024-11-09 15:30:28,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:28,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:28,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:28,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,364 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-09 15:30:28,365 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-09 15:30:28,365 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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) Result 35 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:30:28,387 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-09 15:30:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:28,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-09 15:30:28,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:28,387 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,538 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-09 15:30:28,539 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-09 15:30:28,539 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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) Result 35 states and 42 transitions. Complement of second has 5 states. [2024-11-09 15:30:28,559 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-09 15:30:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:28,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-09 15:30:28,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:28,560 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:28,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:28,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:28,763 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-09 15:30:28,763 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-09 15:30:28,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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) Result 51 states and 63 transitions. Complement of second has 15 states. [2024-11-09 15:30:28,857 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-09 15:30:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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-09 15:30:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2024-11-09 15:30:28,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-09 15:30:28,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:28,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 29 letters. Loop has 2 letters. [2024-11-09 15:30:28,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:28,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 27 letters. Loop has 4 letters. [2024-11-09 15:30:28,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:28,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-11-09 15:30:28,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:28,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 56 transitions. [2024-11-09 15:30:28,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:28,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:28,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2024-11-09 15:30:28,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:28,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-09 15:30:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2024-11-09 15:30:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-11-09 15:30:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 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-09 15:30:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-09 15:30:28,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-09 15:30:28,861 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-09 15:30:28,861 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:30:28,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2024-11-09 15:30:28,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:28,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:28,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:28,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:28,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:28,887 INFO L745 eck$LassoCheckResult]: Stem: 2266#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2260#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2255#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 2256#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2257#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2258#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2259#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2261#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2278#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2277#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2276#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2275#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 2270#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2262#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2263#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2273#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2292#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2264#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2265#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2284#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2268#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2269#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2290#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2289#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2288#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2287#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2286#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2282#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2281#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2279#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2271#L517-3 [2024-11-09 15:30:28,887 INFO L747 eck$LassoCheckResult]: Loop: 2271#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2272#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 2271#L517-3 [2024-11-09 15:30:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1693390338, now seen corresponding path program 8 times [2024-11-09 15:30:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015312509] [2024-11-09 15:30:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:28,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-09 15:30:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015312509] [2024-11-09 15:30:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015312509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808415285] [2024-11-09 15:30:29,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:30:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:29,135 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-09 15:30:29,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:30:29,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:29,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:30:29,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:29,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808415285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:29,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-09 15:30:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483809300] [2024-11-09 15:30:29,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:29,399 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 8 times [2024-11-09 15:30:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48996035] [2024-11-09 15:30:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 15:30:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-09 15:30:29,445 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 14 Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-09 15:30:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:29,526 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-09 15:30:29,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2024-11-09 15:30:29,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:29,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 42 states and 49 transitions. [2024-11-09 15:30:29,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:29,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:29,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2024-11-09 15:30:29,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:29,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-09 15:30:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2024-11-09 15:30:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-09 15:30:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 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-09 15:30:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 15:30:29,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 15:30:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:30:29,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 15:30:29,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:30:29,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2024-11-09 15:30:29,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:29,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:29,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:29,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:29,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:29,532 INFO L745 eck$LassoCheckResult]: Stem: 2571#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2566#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2561#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 2562#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2563#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2564#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2565#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2589#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2588#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2587#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2586#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2585#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 2580#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2579#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 2573#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2567#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2568#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2578#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2574#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2569#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2570#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2600#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2599#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2598#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2596#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2595#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2594#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2593#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2592#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2584#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2583#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2581#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2576#L517-3 [2024-11-09 15:30:29,532 INFO L747 eck$LassoCheckResult]: Loop: 2576#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2575#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 2576#L517-3 [2024-11-09 15:30:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash -54505508, now seen corresponding path program 9 times [2024-11-09 15:30:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004302742] [2024-11-09 15:30:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:29,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 9 times [2024-11-09 15:30:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:29,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039171958] [2024-11-09 15:30:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -840184479, now seen corresponding path program 4 times [2024-11-09 15:30:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:29,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084039415] [2024-11-09 15:30:29,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:29,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:30,278 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:30,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:30,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:30,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:30,278 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:30,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:30,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:30,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:30,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration13_Lasso [2024-11-09 15:30:30,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:30,278 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:30,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:30,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:30,788 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:30,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:30,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:30,789 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-09 15:30:30,790 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-09 15:30:30,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:30,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:30,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:30,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:30,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:30,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:30,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:30,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:30,816 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-09 15:30:30,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:30,817 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-09 15:30:30,818 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-09 15:30:30,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:30,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:30,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:30,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:30,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:30,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:30,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:30,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:30,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:30,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:30,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:30,847 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-09 15:30:30,848 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-09 15:30:30,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:30,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:30,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:30,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:30,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:30,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:30,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:30,865 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:30,876 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:30:30,876 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:30:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:30,878 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-09 15:30:30,879 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-09 15:30:30,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:30,890 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:30,890 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:30,890 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1 Supporting invariants [] [2024-11-09 15:30:30,901 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-09 15:30:30,912 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2024-11-09 15:30:30,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:30,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:30,914 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:30,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:30:30,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:31,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,163 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-09 15:30:31,164 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-09 15:30:31,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,191 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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) Result 42 states and 50 transitions. Complement of second has 5 states. [2024-11-09 15:30:31,191 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-09 15:30:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:31,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2024-11-09 15:30:31,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:31,194 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:31,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:30:31,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,347 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-09 15:30:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:31,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,438 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-09 15:30:31,438 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-09 15:30:31,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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) Result 42 states and 50 transitions. Complement of second has 5 states. [2024-11-09 15:30:31,462 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-09 15:30:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:31,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2024-11-09 15:30:31,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:31,463 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:30:31,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:31,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:31,636 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-09 15:30:31,638 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-09 15:30:31,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,740 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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) Result 59 states and 73 transitions. Complement of second has 17 states. [2024-11-09 15:30:31,740 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-09 15:30:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-09 15:30:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2024-11-09 15:30:31,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 33 letters. Loop has 2 letters. [2024-11-09 15:30:31,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:31,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 35 letters. Loop has 2 letters. [2024-11-09 15:30:31,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:31,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 33 letters. Loop has 4 letters. [2024-11-09 15:30:31,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:31,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2024-11-09 15:30:31,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:31,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 54 states and 66 transitions. [2024-11-09 15:30:31,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:31,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:31,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2024-11-09 15:30:31,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:31,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-11-09 15:30:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2024-11-09 15:30:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-11-09 15:30:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 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-09 15:30:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-09 15:30:31,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 15:30:31,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-09 15:30:31,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:30:31,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-09 15:30:31,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:31,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:31,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:31,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:31,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:31,752 INFO L745 eck$LassoCheckResult]: Stem: 3185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3179#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3174#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 3175#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3176#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3177#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3178#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3180#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3199#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3198#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3197#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3196#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3195#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3194#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 3187#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3181#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3182#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3218#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3217#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3183#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3184#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3192#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3188#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3189#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3215#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3214#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3213#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3212#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3210#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3209#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3208#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3207#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3206#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3203#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3202#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3200#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3190#L517-3 [2024-11-09 15:30:31,752 INFO L747 eck$LassoCheckResult]: Loop: 3190#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3191#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 3190#L517-3 [2024-11-09 15:30:31,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash 36566833, now seen corresponding path program 10 times [2024-11-09 15:30:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:31,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858799672] [2024-11-09 15:30:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:31,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858799672] [2024-11-09 15:30:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858799672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65431035] [2024-11-09 15:30:31,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:30:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:31,922 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:31,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-09 15:30:31,998 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:30:31,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:31,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:30:32,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:32,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:32,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65431035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:32,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:32,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-11-09 15:30:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098209048] [2024-11-09 15:30:32,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:32,242 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:32,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 10 times [2024-11-09 15:30:32,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:32,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708861728] [2024-11-09 15:30:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 15:30:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2024-11-09 15:30:32,278 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 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-09 15:30:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:32,382 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-11-09 15:30:32,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 89 transitions. [2024-11-09 15:30:32,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:32,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 57 transitions. [2024-11-09 15:30:32,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:32,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:32,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2024-11-09 15:30:32,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:32,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 15:30:32,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2024-11-09 15:30:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-09 15:30:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 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-09 15:30:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-09 15:30:32,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-09 15:30:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 15:30:32,409 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-09 15:30:32,410 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:30:32,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2024-11-09 15:30:32,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:32,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:32,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:32,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:32,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:32,411 INFO L745 eck$LassoCheckResult]: Stem: 3549#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3543#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3538#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 3539#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3540#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3541#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3542#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3544#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3568#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3567#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3566#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3565#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3564#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3563#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 3558#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3557#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 3551#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3545#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3546#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3555#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3552#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3547#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3548#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3584#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3583#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3582#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3580#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3579#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3578#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3577#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3575#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3574#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3573#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3572#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3571#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3562#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3561#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3559#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3553#L517-3 [2024-11-09 15:30:32,411 INFO L747 eck$LassoCheckResult]: Loop: 3553#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3554#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 3553#L517-3 [2024-11-09 15:30:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -643498353, now seen corresponding path program 11 times [2024-11-09 15:30:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696539625] [2024-11-09 15:30:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 11 times [2024-11-09 15:30:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092842913] [2024-11-09 15:30:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash 73374548, now seen corresponding path program 5 times [2024-11-09 15:30:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000359777] [2024-11-09 15:30:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:32,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:34,552 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:34,553 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:34,553 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:34,553 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:34,553 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:34,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:34,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:34,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:34,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration15_Lasso [2024-11-09 15:30:34,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:34,553 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:34,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:34,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:35,357 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:35,357 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:35,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,358 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-09 15:30:35,359 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-09 15:30:35,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:35,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,383 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-09 15:30:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,385 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-09 15:30:35,386 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-09 15:30:35,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-09 15:30:35,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,410 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-09 15:30:35,411 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-09 15:30:35,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-09 15:30:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,434 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-09 15:30:35,435 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-09 15:30:35,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:35,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:35,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-09 15:30:35,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,461 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-09 15:30:35,462 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-09 15:30:35,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,485 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-09 15:30:35,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,487 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-09 15:30:35,487 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-09 15:30:35,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-09 15:30:35,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,509 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-09 15:30:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,511 INFO L229 MonitoredProcess]: Starting monitored process 73 with /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-09 15:30:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-09 15:30:35,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,535 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-09 15:30:35,536 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-09 15:30:35,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,561 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-09 15:30:35,561 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-09 15:30:35,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-09 15:30:35,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,585 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-09 15:30:35,586 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-09 15:30:35,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-09 15:30:35,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,612 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-09 15:30:35,613 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-09 15:30:35,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-09 15:30:35,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:35,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:35,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,638 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-09 15:30:35,638 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-09 15:30:35,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-09 15:30:35,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,661 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-09 15:30:35,662 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-09 15:30:35,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:35,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:35,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:35,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,686 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-09 15:30:35,687 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-09 15:30:35,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:35,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:35,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,722 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-09 15:30:35,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,724 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-09 15:30:35,724 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-09 15:30:35,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:35,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:35,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:35,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:35,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,752 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-09 15:30:35,753 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-09 15:30:35,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:35,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:35,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:35,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:35,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:35,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:35,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:35,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:35,776 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:30:35,776 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-09 15:30:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:35,778 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-09 15:30:35,778 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-09 15:30:35,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:35,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:35,789 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:35,790 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1 Supporting invariants [] [2024-11-09 15:30:35,799 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-09 15:30:35,833 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2024-11-09 15:30:35,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:35,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:35,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:35,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:35,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:35,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:36,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,041 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-09 15:30:36,042 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-09 15:30:36,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,078 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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) Result 49 states and 58 transitions. Complement of second has 5 states. [2024-11-09 15:30:36,078 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-09 15:30:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:36,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-09 15:30:36,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:36,079 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:36,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:36,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:36,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,325 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-09 15:30:36,325 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-09 15:30:36,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:36,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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) Result 49 states and 58 transitions. Complement of second has 5 states. [2024-11-09 15:30:36,374 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-09 15:30:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:36,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-09 15:30:36,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:36,375 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:36,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:36,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:36,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:36,616 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-09 15:30:36,617 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-09 15:30:36,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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) Result 67 states and 83 transitions. Complement of second has 19 states. [2024-11-09 15:30:36,749 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-09 15:30:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-09 15:30:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2024-11-09 15:30:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-09 15:30:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 41 letters. Loop has 2 letters. [2024-11-09 15:30:36,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:36,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 39 letters. Loop has 4 letters. [2024-11-09 15:30:36,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:36,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 83 transitions. [2024-11-09 15:30:36,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:36,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 76 transitions. [2024-11-09 15:30:36,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:36,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:36,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 76 transitions. [2024-11-09 15:30:36,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:36,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-09 15:30:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 76 transitions. [2024-11-09 15:30:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-11-09 15:30:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 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-09 15:30:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-09 15:30:36,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-09 15:30:36,754 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-09 15:30:36,754 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-09 15:30:36,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2024-11-09 15:30:36,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:36,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:36,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:36,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:36,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:36,755 INFO L745 eck$LassoCheckResult]: Stem: 4274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4269#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4264#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 4265#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4266#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4267#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4268#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4291#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4290#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4289#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4288#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4287#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4286#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4285#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4284#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4283#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 4278#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4270#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4271#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4315#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4314#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4272#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4273#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4281#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4276#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4277#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4312#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4311#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4310#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4309#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4307#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4306#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4305#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4304#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4302#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4301#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4300#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4299#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4298#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4295#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4294#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4292#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4279#L517-3 [2024-11-09 15:30:36,755 INFO L747 eck$LassoCheckResult]: Loop: 4279#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4280#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 4279#L517-3 [2024-11-09 15:30:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1793463396, now seen corresponding path program 12 times [2024-11-09 15:30:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014214810] [2024-11-09 15:30:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:36,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014214810] [2024-11-09 15:30:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014214810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321949359] [2024-11-09 15:30:36,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:30:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:36,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:36,959 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:36,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2024-11-09 15:30:37,039 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-09 15:30:37,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:37,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:30:37,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:37,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:37,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321949359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:37,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-11-09 15:30:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082443923] [2024-11-09 15:30:37,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:37,319 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 12 times [2024-11-09 15:30:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513782260] [2024-11-09 15:30:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 15:30:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2024-11-09 15:30:37,355 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 18 Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 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-09 15:30:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:37,466 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-11-09 15:30:37,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 103 transitions. [2024-11-09 15:30:37,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:37,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 56 states and 65 transitions. [2024-11-09 15:30:37,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:37,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:37,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2024-11-09 15:30:37,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:37,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-09 15:30:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2024-11-09 15:30:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-09 15:30:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 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-09 15:30:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-09 15:30:37,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-09 15:30:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 15:30:37,470 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-09 15:30:37,470 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-09 15:30:37,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2024-11-09 15:30:37,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:37,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:37,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:37,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:37,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:37,471 INFO L745 eck$LassoCheckResult]: Stem: 4697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4698#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4691#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4690#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 4686#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4687#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4688#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4689#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4692#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4718#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4717#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4716#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4715#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4714#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4713#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4712#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4711#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 4706#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4705#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 4699#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4693#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4694#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4703#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4700#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4695#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4696#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4739#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4738#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4737#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4735#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4734#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4733#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4732#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4730#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4729#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4728#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4727#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4725#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4724#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4723#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4722#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4721#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4710#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4709#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4707#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4701#L517-3 [2024-11-09 15:30:37,471 INFO L747 eck$LassoCheckResult]: Loop: 4701#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4702#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 4701#L517-3 [2024-11-09 15:30:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1162190146, now seen corresponding path program 13 times [2024-11-09 15:30:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961772607] [2024-11-09 15:30:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 13 times [2024-11-09 15:30:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212349840] [2024-11-09 15:30:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 173234503, now seen corresponding path program 6 times [2024-11-09 15:30:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972642350] [2024-11-09 15:30:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:37,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:39,081 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:39,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:39,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:39,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:39,082 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:39,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:39,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:39,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration17_Lasso [2024-11-09 15:30:39,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:39,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:39,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,724 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:39,724 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:39,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,726 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-09 15:30:39,727 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-09 15:30:39,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-09 15:30:39,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,751 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-09 15:30:39,752 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-09 15:30:39,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,776 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-09 15:30:39,777 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-09 15:30:39,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-09 15:30:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,801 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-09 15:30:39,802 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-09 15:30:39,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:39,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:39,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:39,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,827 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-09 15:30:39,828 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-09 15:30:39,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,850 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-09 15:30:39,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,852 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-09 15:30:39,853 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-09 15:30:39,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:39,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,875 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-09 15:30:39,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,876 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-09 15:30:39,877 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-09 15:30:39,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,899 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-09 15:30:39,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,901 INFO L229 MonitoredProcess]: Starting monitored process 92 with /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-09 15:30:39,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-09 15:30:39,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:39,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-11-09 15:30:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,926 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-09 15:30:39,927 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-09 15:30:39,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,951 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-09 15:30:39,952 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-09 15:30:39,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:39,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:39,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:39,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:39,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:39,975 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-09 15:30:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:39,976 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-09 15:30:39,977 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-09 15:30:39,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:39,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:39,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:39,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:39,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:39,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:39,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:39,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:40,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,006 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-09 15:30:40,008 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-09 15:30:40,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:40,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:40,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:40,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:40,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,032 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-09 15:30:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,034 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-09 15:30:40,035 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-09 15:30:40,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:40,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:40,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:40,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:40,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,061 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-09 15:30:40,062 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-09 15:30:40,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:40,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:40,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,087 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-09 15:30:40,088 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-09 15:30:40,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:40,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:40,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:40,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:40,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,112 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-09 15:30:40,113 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-09 15:30:40,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:40,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,139 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-09 15:30:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,140 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-09 15:30:40,141 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-09 15:30:40,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-09 15:30:40,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,168 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-09 15:30:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,169 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-09 15:30:40,170 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-09 15:30:40,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-09 15:30:40,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,198 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-09 15:30:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,199 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-09 15:30:40,200 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-09 15:30:40,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:40,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:40,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,228 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-09 15:30:40,230 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-09 15:30:40,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:40,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:40,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:40,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:40,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:40,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:40,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:40,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:40,253 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:30:40,253 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:30:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:40,254 INFO L229 MonitoredProcess]: Starting monitored process 105 with /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-09 15:30:40,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-09 15:30:40,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:40,267 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:40,267 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:40,267 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1 Supporting invariants [] [2024-11-09 15:30:40,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-09 15:30:40,300 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2024-11-09 15:30:40,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:40,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:40,303 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:40,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:40,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:30:40,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:40,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:40,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:40,785 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-09 15:30:40,786 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-09 15:30:40,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:40,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 56 states and 66 transitions. Complement of second has 5 states. [2024-11-09 15:30:40,820 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-09 15:30:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:40,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2024-11-09 15:30:40,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:40,820 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:40,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:30:40,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:40,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:41,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:41,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:41,215 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-09 15:30:41,216 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-09 15:30:41,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:41,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 56 states and 66 transitions. Complement of second has 5 states. [2024-11-09 15:30:41,248 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-09 15:30:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:41,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2024-11-09 15:30:41,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:41,253 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:41,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:30:41,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:41,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:41,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:41,651 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-09 15:30:41,651 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-09 15:30:41,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:41,868 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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 75 states and 93 transitions. Complement of second has 21 states. [2024-11-09 15:30:41,868 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-09 15:30:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-09 15:30:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2024-11-09 15:30:41,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 45 letters. Loop has 2 letters. [2024-11-09 15:30:41,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:41,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 47 letters. Loop has 2 letters. [2024-11-09 15:30:41,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:41,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 45 letters. Loop has 4 letters. [2024-11-09 15:30:41,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:41,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2024-11-09 15:30:41,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:41,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 86 transitions. [2024-11-09 15:30:41,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:41,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:41,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2024-11-09 15:30:41,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:41,872 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-09 15:30:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2024-11-09 15:30:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-09 15:30:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 59 states have internal predecessors, (70), 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-09 15:30:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-11-09 15:30:41,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-11-09 15:30:41,875 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-11-09 15:30:41,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-09 15:30:41,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2024-11-09 15:30:41,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:41,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:41,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:41,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:41,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:41,879 INFO L745 eck$LassoCheckResult]: Stem: 5499#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5493#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5488#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 5489#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5490#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5491#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5492#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5494#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5517#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5516#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5515#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5514#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5513#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5512#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5511#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5510#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5509#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5508#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 5501#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5495#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5496#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5546#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5545#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5497#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5498#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5506#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5502#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5503#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5543#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5542#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5541#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5540#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5538#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5537#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5536#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5535#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5533#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5532#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5531#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5530#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5528#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5527#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5526#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5525#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5524#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5521#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5520#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5518#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5504#L517-3 [2024-11-09 15:30:41,880 INFO L747 eck$LassoCheckResult]: Loop: 5504#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5505#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 5504#L517-3 [2024-11-09 15:30:41,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1025367657, now seen corresponding path program 14 times [2024-11-09 15:30:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000468991] [2024-11-09 15:30:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000468991] [2024-11-09 15:30:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000468991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497171186] [2024-11-09 15:30:42,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:30:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:42,283 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2024-11-09 15:30:42,372 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:30:42,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:42,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:30:42,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:42,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497171186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:42,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-11-09 15:30:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826994022] [2024-11-09 15:30:42,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:42,756 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:42,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 14 times [2024-11-09 15:30:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417149531] [2024-11-09 15:30:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 15:30:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2024-11-09 15:30:42,795 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. cyclomatic complexity: 20 Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 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-09 15:30:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:42,912 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-11-09 15:30:42,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 117 transitions. [2024-11-09 15:30:42,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:42,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 63 states and 73 transitions. [2024-11-09 15:30:42,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:42,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:42,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 73 transitions. [2024-11-09 15:30:42,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:42,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-09 15:30:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 73 transitions. [2024-11-09 15:30:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-11-09 15:30:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 61 states have internal predecessors, (72), 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-09 15:30:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-09 15:30:42,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-09 15:30:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 15:30:42,916 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-09 15:30:42,916 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-09 15:30:42,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2024-11-09 15:30:42,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:42,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:42,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:42,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:42,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:42,917 INFO L745 eck$LassoCheckResult]: Stem: 5979#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5980#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5973#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5972#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 5968#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5969#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5970#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5971#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5974#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6002#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6001#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6000#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5999#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5998#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5997#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5996#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5995#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5994#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5993#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 5988#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5987#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 5981#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5975#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5976#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5985#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5982#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5977#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5978#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6028#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6027#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6026#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6024#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6023#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6022#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6021#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6019#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6018#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6017#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6016#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6014#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6013#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6012#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6011#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6009#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6008#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6007#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6006#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6005#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5992#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5991#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5989#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5983#L517-3 [2024-11-09 15:30:42,917 INFO L747 eck$LassoCheckResult]: Loop: 5983#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5984#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 5983#L517-3 [2024-11-09 15:30:42,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1227033589, now seen corresponding path program 15 times [2024-11-09 15:30:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190361176] [2024-11-09 15:30:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 15 times [2024-11-09 15:30:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543478733] [2024-11-09 15:30:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1936726214, now seen corresponding path program 7 times [2024-11-09 15:30:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035291241] [2024-11-09 15:30:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:42,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:45,384 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:45,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:45,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:45,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:45,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:45,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:45,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:45,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:45,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration19_Lasso [2024-11-09 15:30:45,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:45,385 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:45,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:45,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:46,151 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:46,151 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:46,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,153 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-09 15:30:46,154 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-09 15:30:46,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,176 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-09 15:30:46,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,178 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-09 15:30:46,179 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-09 15:30:46,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,204 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-09 15:30:46,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,205 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-09 15:30:46,206 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-09 15:30:46,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,229 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-09 15:30:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,231 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-09 15:30:46,232 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-09 15:30:46,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,256 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-09 15:30:46,256 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-09 15:30:46,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,281 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-09 15:30:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,283 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-09 15:30:46,283 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-09 15:30:46,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-09 15:30:46,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,306 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-09 15:30:46,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,308 INFO L229 MonitoredProcess]: Starting monitored process 113 with /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-09 15:30:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-09 15:30:46,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-09 15:30:46,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,332 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-09 15:30:46,332 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-09 15:30:46,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,358 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-09 15:30:46,359 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-09 15:30:46,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,381 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-09 15:30:46,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,382 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-09 15:30:46,383 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-09 15:30:46,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,405 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-09 15:30:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,406 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-09 15:30:46,407 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-09 15:30:46,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,433 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-09 15:30:46,433 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-09 15:30:46,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-09 15:30:46,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,456 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-09 15:30:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,457 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-09 15:30:46,458 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-09 15:30:46,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-09 15:30:46,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,480 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-09 15:30:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,481 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-09 15:30:46,482 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-09 15:30:46,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,506 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-09 15:30:46,507 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-09 15:30:46,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,531 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-09 15:30:46,531 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-09 15:30:46,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,557 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-09 15:30:46,558 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-09 15:30:46,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:46,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:46,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:46,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-09 15:30:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,582 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-09 15:30:46,583 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-09 15:30:46,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:46,610 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-09 15:30:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,611 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-09 15:30:46,612 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-09 15:30:46,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:46,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:46,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:46,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:46,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:46,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:46,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:46,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:46,645 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:30:46,645 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:30:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:46,647 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-09 15:30:46,648 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-09 15:30:46,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:46,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:46,660 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:46,660 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1 Supporting invariants [] [2024-11-09 15:30:46,674 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-09 15:30:46,691 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2024-11-09 15:30:46,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:46,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:46,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:46,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:30:46,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:46,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:46,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:46,956 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-09 15:30:46,956 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-09 15:30:46,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:46,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 5 states. [2024-11-09 15:30:46,986 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-09 15:30:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:46,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2024-11-09 15:30:46,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:46,987 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:47,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:47,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:30:47,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:47,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:47,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:47,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-09 15:30:47,320 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-09 15:30:47,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:47,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 5 states. [2024-11-09 15:30:47,350 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-09 15:30:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:47,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2024-11-09 15:30:47,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:47,350 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:47,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:30:47,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:47,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:47,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:47,644 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-09 15:30:47,645 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-09 15:30:47,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:47,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 83 states and 103 transitions. Complement of second has 23 states. [2024-11-09 15:30:47,836 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-09 15:30:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2024-11-09 15:30:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 51 letters. Loop has 2 letters. [2024-11-09 15:30:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 53 letters. Loop has 2 letters. [2024-11-09 15:30:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 51 letters. Loop has 4 letters. [2024-11-09 15:30:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:47,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 103 transitions. [2024-11-09 15:30:47,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:47,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 78 states and 96 transitions. [2024-11-09 15:30:47,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:47,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:47,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. [2024-11-09 15:30:47,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:47,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-09 15:30:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. [2024-11-09 15:30:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-11-09 15:30:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 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-09 15:30:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-11-09 15:30:47,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-11-09 15:30:47,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-11-09 15:30:47,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-09 15:30:47,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2024-11-09 15:30:47,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:47,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:47,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:47,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:47,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:47,841 INFO L745 eck$LassoCheckResult]: Stem: 6870#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6871#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6865#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6860#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 6861#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6862#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6863#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6864#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6891#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6890#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6889#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6888#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6887#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6886#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6884#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6882#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6881#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 6880#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6879#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 6874#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6866#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6867#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6925#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6924#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6868#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6869#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6877#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6872#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6873#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6922#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6921#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6920#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6919#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6917#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6916#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6915#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6914#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6912#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6911#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6910#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6909#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6907#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6906#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6905#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6904#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6902#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6901#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6900#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6899#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6898#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6895#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6894#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6892#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6875#L517-3 [2024-11-09 15:30:47,841 INFO L747 eck$LassoCheckResult]: Loop: 6875#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6876#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 6875#L517-3 [2024-11-09 15:30:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1473052982, now seen corresponding path program 16 times [2024-11-09 15:30:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860924981] [2024-11-09 15:30:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 91 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:48,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860924981] [2024-11-09 15:30:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860924981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356523533] [2024-11-09 15:30:48,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:30:48,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:48,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:48,096 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:48,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2024-11-09 15:30:48,208 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:30:48,209 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:48,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:30:48,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:48,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356523533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:48,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-11-09 15:30:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420429120] [2024-11-09 15:30:48,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:48,665 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:48,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 16 times [2024-11-09 15:30:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:48,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284560650] [2024-11-09 15:30:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 15:30:48,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2024-11-09 15:30:48,707 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 22 Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 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-09 15:30:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:48,877 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2024-11-09 15:30:48,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2024-11-09 15:30:48,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:48,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 70 states and 81 transitions. [2024-11-09 15:30:48,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:48,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:48,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2024-11-09 15:30:48,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:48,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-11-09 15:30:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2024-11-09 15:30:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-09 15:30:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 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-09 15:30:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-09 15:30:48,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-09 15:30:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 15:30:48,881 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-09 15:30:48,881 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-09 15:30:48,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-11-09 15:30:48,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:48,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:48,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:48,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:48,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:48,882 INFO L745 eck$LassoCheckResult]: Stem: 7409#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7410#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 7403#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7402#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 7398#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7399#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7400#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7401#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7404#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7434#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7433#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7432#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7431#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7430#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7429#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7428#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7427#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7426#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7425#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7424#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7423#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 7418#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7417#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 7411#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 7405#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7406#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7415#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7412#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7407#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7408#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7465#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7464#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7463#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7461#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7460#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7459#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7458#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7456#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7455#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7454#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7453#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7451#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7450#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7449#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7448#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7446#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7445#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7444#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7443#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7441#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7440#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7439#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7438#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7437#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7422#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7421#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7419#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7413#L517-3 [2024-11-09 15:30:48,882 INFO L747 eck$LassoCheckResult]: Loop: 7413#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7414#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 7413#L517-3 [2024-11-09 15:30:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1562782376, now seen corresponding path program 17 times [2024-11-09 15:30:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668916673] [2024-11-09 15:30:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:48,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 17 times [2024-11-09 15:30:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:48,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769231920] [2024-11-09 15:30:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1404689107, now seen corresponding path program 8 times [2024-11-09 15:30:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881882500] [2024-11-09 15:30:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:48,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:52,034 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:52,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:52,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:52,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:52,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:52,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:52,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:52,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:52,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration21_Lasso [2024-11-09 15:30:52,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:52,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:52,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:52,943 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:52,943 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:52,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:52,946 INFO L229 MonitoredProcess]: Starting monitored process 128 with /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-09 15:30:52,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-09 15:30:52,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:52,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:52,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:52,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:52,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:52,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:52,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:52,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:52,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:52,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:52,983 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-09 15:30:52,984 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-09 15:30:52,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-09 15:30:52,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:52,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:52,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:52,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:52,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:52,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:52,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,009 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-09 15:30:53,010 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-09 15:30:53,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,033 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-09 15:30:53,034 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-09 15:30:53,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,055 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-09 15:30:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,057 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-09 15:30:53,058 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-09 15:30:53,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,081 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-09 15:30:53,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,082 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-09 15:30:53,084 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-09 15:30:53,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-09 15:30:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,106 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-09 15:30:53,107 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-09 15:30:53,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-09 15:30:53,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,130 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-09 15:30:53,131 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-09 15:30:53,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-09 15:30:53,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,152 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-09 15:30:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,153 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-09 15:30:53,154 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-09 15:30:53,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,181 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-09 15:30:53,182 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-09 15:30:53,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-09 15:30:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,206 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-09 15:30:53,206 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-09 15:30:53,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,231 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-09 15:30:53,232 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-09 15:30:53,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,255 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-09 15:30:53,256 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-09 15:30:53,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,278 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-09 15:30:53,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,280 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-09 15:30:53,281 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-09 15:30:53,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,303 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-09 15:30:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,305 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-09 15:30:53,306 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-09 15:30:53,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,329 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-09 15:30:53,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,331 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-09 15:30:53,331 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-09 15:30:53,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:53,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,356 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-09 15:30:53,357 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-09 15:30:53,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:53,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:53,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:53,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,381 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-09 15:30:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,383 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-09 15:30:53,383 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-09 15:30:53,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,412 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-09 15:30:53,412 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-09 15:30:53,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,444 INFO L229 MonitoredProcess]: Starting monitored process 147 with /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-09 15:30:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-09 15:30:53,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,472 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-09 15:30:53,473 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-09 15:30:53,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-09 15:30:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,519 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-09 15:30:53,519 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-09 15:30:53,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,563 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-09 15:30:53,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,565 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-09 15:30:53,565 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-09 15:30:53,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,593 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-09 15:30:53,594 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-09 15:30:53,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-09 15:30:53,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,624 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-09 15:30:53,628 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-09 15:30:53,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,659 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-09 15:30:53,661 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-09 15:30:53,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,689 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-09 15:30:53,689 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-09 15:30:53,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:53,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:53,715 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-09 15:30:53,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,716 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-09 15:30:53,717 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-09 15:30:53,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:30:53,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:53,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:53,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:53,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:53,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:53,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:53,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:53,742 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:30:53,742 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:30:53,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:53,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:53,743 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-09 15:30:53,744 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-09 15:30:53,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:53,756 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:53,756 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:53,756 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2024-11-09 15:30:53,767 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-09 15:30:53,809 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2024-11-09 15:30:53,816 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:30:53,816 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:30:53,816 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:30:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:53,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:30:53,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:54,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:54,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,123 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-09 15:30:54,124 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-09 15:30:54,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:54,151 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 5 states. [2024-11-09 15:30:54,151 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-09 15:30:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:54,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2024-11-09 15:30:54,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:54,151 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:54,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:30:54,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:54,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:54,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,461 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-09 15:30:54,461 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-09 15:30:54,461 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:54,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 5 states. [2024-11-09 15:30:54,517 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-09 15:30:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:30:54,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2024-11-09 15:30:54,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:54,517 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:30:54,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:54,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:30:54,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:54,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:30:54,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:54,828 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-09 15:30:54,828 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-09 15:30:54,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:55,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 113 transitions. Complement of second has 25 states. [2024-11-09 15:30:55,053 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-09 15:30:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2024-11-09 15:30:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 57 letters. Loop has 2 letters. [2024-11-09 15:30:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 59 letters. Loop has 2 letters. [2024-11-09 15:30:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 57 letters. Loop has 4 letters. [2024-11-09 15:30:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:55,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. [2024-11-09 15:30:55,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:55,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 86 states and 106 transitions. [2024-11-09 15:30:55,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:30:55,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:30:55,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 106 transitions. [2024-11-09 15:30:55,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:55,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-11-09 15:30:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 106 transitions. [2024-11-09 15:30:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-11-09 15:30:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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-09 15:30:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-09 15:30:55,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-09 15:30:55,056 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-09 15:30:55,056 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-09 15:30:55,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-09 15:30:55,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:55,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:55,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:55,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:55,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:55,060 INFO L745 eck$LassoCheckResult]: Stem: 8393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8388#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8383#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 8384#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8385#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8386#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8387#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8416#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8415#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8414#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8413#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8412#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8411#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8410#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8409#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8408#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8407#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8406#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8405#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8404#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8403#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8402#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 8397#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 8389#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8390#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8455#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8454#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8391#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8392#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8401#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8395#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8396#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8452#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8451#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8450#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8449#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8447#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8446#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8445#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8444#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8442#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8441#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8440#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8439#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8437#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8436#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8435#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8434#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8432#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8431#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8430#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8429#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8427#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8426#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8425#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8424#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8423#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8420#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8419#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8417#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8399#L517-3 [2024-11-09 15:30:55,060 INFO L747 eck$LassoCheckResult]: Loop: 8399#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8398#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 8399#L517-3 [2024-11-09 15:30:55,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1286501379, now seen corresponding path program 18 times [2024-11-09 15:30:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051017613] [2024-11-09 15:30:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 120 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051017613] [2024-11-09 15:30:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051017613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687866607] [2024-11-09 15:30:55,357 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:30:55,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:55,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:55,358 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2024-11-09 15:30:55,507 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-09 15:30:55,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:55,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:30:55,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:55,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:55,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687866607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:55,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:55,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-11-09 15:30:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754229436] [2024-11-09 15:30:55,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:55,991 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:55,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 18 times [2024-11-09 15:30:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:55,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508150906] [2024-11-09 15:30:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:55,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:55,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 15:30:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 15:30:56,029 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 24 Second operand has 35 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 35 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-09 15:30:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:56,198 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2024-11-09 15:30:56,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 145 transitions. [2024-11-09 15:30:56,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:56,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 77 states and 89 transitions. [2024-11-09 15:30:56,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:30:56,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:30:56,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 89 transitions. [2024-11-09 15:30:56,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:30:56,199 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-11-09 15:30:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 89 transitions. [2024-11-09 15:30:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-09 15:30:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 75 states have internal predecessors, (88), 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-09 15:30:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-11-09 15:30:56,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-09 15:30:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 15:30:56,201 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-09 15:30:56,201 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-09 15:30:56,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 88 transitions. [2024-11-09 15:30:56,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:56,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:56,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:56,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:56,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:56,202 INFO L745 eck$LassoCheckResult]: Stem: 8990#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8991#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8984#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8979#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 8980#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8981#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8982#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8983#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8985#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9017#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9016#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9015#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9014#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9013#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9012#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9011#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9010#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9009#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9008#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9007#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9006#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 9005#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9004#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 8999#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8998#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 8993#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 8986#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8987#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8997#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8992#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8988#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8989#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9053#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9052#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9051#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9049#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9048#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9047#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9046#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9044#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9043#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9042#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9041#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9039#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9038#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9037#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9036#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9034#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9033#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9032#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9031#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9029#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9028#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9027#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9026#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9024#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9023#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9022#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9021#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9020#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9003#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9002#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9000#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8995#L517-3 [2024-11-09 15:30:56,202 INFO L747 eck$LassoCheckResult]: Loop: 8995#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8994#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 8995#L517-3 [2024-11-09 15:30:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 832559451, now seen corresponding path program 19 times [2024-11-09 15:30:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772887734] [2024-11-09 15:30:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:56,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 19 times [2024-11-09 15:30:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785198398] [2024-11-09 15:30:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:56,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1225716512, now seen corresponding path program 9 times [2024-11-09 15:30:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355169615] [2024-11-09 15:30:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:56,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:00,599 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:00,600 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:00,600 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:00,600 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:00,600 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:31:00,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:00,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:00,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:00,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration23_Lasso [2024-11-09 15:31:00,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:00,600 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:00,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:00,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:01,355 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:31:01,355 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:31:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,357 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-09 15:31:01,358 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-09 15:31:01,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,381 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-09 15:31:01,382 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-09 15:31:01,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,406 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-09 15:31:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,407 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-09 15:31:01,408 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-09 15:31:01,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,433 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-09 15:31:01,433 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-09 15:31:01,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-09 15:31:01,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,457 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-09 15:31:01,457 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-09 15:31:01,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-09 15:31:01,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,479 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-09 15:31:01,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,480 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-09 15:31:01,481 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-09 15:31:01,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,504 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-09 15:31:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,505 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-09 15:31:01,506 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-09 15:31:01,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,530 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-09 15:31:01,530 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-09 15:31:01,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-09 15:31:01,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,557 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-09 15:31:01,558 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-09 15:31:01,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-09 15:31:01,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:01,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:01,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:01,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,592 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-09 15:31:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,594 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-09 15:31:01,594 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-09 15:31:01,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,618 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-09 15:31:01,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,619 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-09 15:31:01,620 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-09 15:31:01,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,648 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-09 15:31:01,649 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-09 15:31:01,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:01,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,678 INFO L229 MonitoredProcess]: Starting monitored process 170 with /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-09 15:31:01,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-09 15:31:01,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:01,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,711 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-09 15:31:01,712 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-09 15:31:01,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:01,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,743 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-09 15:31:01,744 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-09 15:31:01,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,777 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-09 15:31:01,778 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-09 15:31:01,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:01,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,806 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-09 15:31:01,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,807 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-09 15:31:01,808 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-09 15:31:01,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,837 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-09 15:31:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,838 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-09 15:31:01,839 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-09 15:31:01,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:01,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:01,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,878 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-09 15:31:01,879 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-09 15:31:01,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:01,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:01,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:01,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:01,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:01,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:01,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:01,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:31:01,907 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:31:01,907 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:31:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:01,909 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-09 15:31:01,910 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-09 15:31:01,910 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:31:01,922 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:31:01,922 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:31:01,922 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1 Supporting invariants [] [2024-11-09 15:31:01,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:01,956 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-11-09 15:31:01,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:31:01,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:31:01,958 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:31:01,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:01,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:02,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,244 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-09 15:31:02,244 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-09 15:31:02,245 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:02,280 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Result 77 states and 90 transitions. Complement of second has 5 states. [2024-11-09 15:31:02,280 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-09 15:31:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:02,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2024-11-09 15:31:02,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:02,281 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:02,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:02,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:02,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,626 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-09 15:31:02,626 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-09 15:31:02,626 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:02,651 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Result 77 states and 90 transitions. Complement of second has 5 states. [2024-11-09 15:31:02,652 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-09 15:31:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:02,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2024-11-09 15:31:02,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:02,652 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:02,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,827 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-09 15:31:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:02,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:02,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:02,964 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-09 15:31:02,964 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-09 15:31:02,964 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:03,146 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Result 99 states and 123 transitions. Complement of second has 27 states. [2024-11-09 15:31:03,147 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-09 15:31:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-09 15:31:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2024-11-09 15:31:03,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 2 letters. [2024-11-09 15:31:03,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:03,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 65 letters. Loop has 2 letters. [2024-11-09 15:31:03,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:03,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 4 letters. [2024-11-09 15:31:03,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:03,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 123 transitions. [2024-11-09 15:31:03,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:03,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 94 states and 116 transitions. [2024-11-09 15:31:03,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:31:03,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:31:03,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 116 transitions. [2024-11-09 15:31:03,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:03,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 116 transitions. [2024-11-09 15:31:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 116 transitions. [2024-11-09 15:31:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2024-11-09 15:31:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 80 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-09 15:31:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-11-09 15:31:03,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-09 15:31:03,150 INFO L425 stractBuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-11-09 15:31:03,150 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-09 15:31:03,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 94 transitions. [2024-11-09 15:31:03,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:03,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:03,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:03,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:03,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:03,151 INFO L745 eck$LassoCheckResult]: Stem: 10067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10068#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10062#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 10057#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 10058#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10059#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10060#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10061#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10092#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10091#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10090#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10089#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10088#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10087#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10086#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10085#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10084#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10083#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10082#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10081#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10080#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10079#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10078#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10077#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10076#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 10071#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 10063#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10064#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10136#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10135#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10065#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10066#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10074#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10069#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10070#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10133#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10132#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10131#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10130#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10128#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10127#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10126#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10125#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10123#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10122#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10121#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10120#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10118#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10117#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10116#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10115#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10113#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10112#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10111#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10110#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10108#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10107#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10106#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10105#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10103#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10102#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10101#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10100#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10099#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10096#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10095#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10093#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10072#L517-3 [2024-11-09 15:31:03,151 INFO L747 eck$LassoCheckResult]: Loop: 10072#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10073#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 10072#L517-3 [2024-11-09 15:31:03,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:03,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1092528432, now seen corresponding path program 20 times [2024-11-09 15:31:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806436583] [2024-11-09 15:31:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 153 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:03,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806436583] [2024-11-09 15:31:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806436583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377389882] [2024-11-09 15:31:03,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:31:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:03,534 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:03,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2024-11-09 15:31:03,653 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:31:03,653 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:03,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 15:31:03,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:03,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377389882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:04,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:04,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-11-09 15:31:04,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651874194] [2024-11-09 15:31:04,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:04,113 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 20 times [2024-11-09 15:31:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866543368] [2024-11-09 15:31:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 15:31:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 15:31:04,154 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. cyclomatic complexity: 26 Second operand has 38 states, 37 states have (on average 3.1621621621621623) internal successors, (117), 38 states have internal predecessors, (117), 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-09 15:31:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:04,324 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2024-11-09 15:31:04,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 159 transitions. [2024-11-09 15:31:04,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:04,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 84 states and 97 transitions. [2024-11-09 15:31:04,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:31:04,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:31:04,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 97 transitions. [2024-11-09 15:31:04,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:04,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 97 transitions. [2024-11-09 15:31:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 97 transitions. [2024-11-09 15:31:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 15:31:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 82 states have internal predecessors, (96), 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-09 15:31:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2024-11-09 15:31:04,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-11-09 15:31:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 15:31:04,327 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-11-09 15:31:04,327 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-09 15:31:04,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 96 transitions. [2024-11-09 15:31:04,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:04,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:04,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:04,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:04,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:04,329 INFO L745 eck$LassoCheckResult]: Stem: 10722#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10723#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10716#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 10711#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 10712#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10713#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10714#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10715#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10717#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10751#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10750#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10749#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10748#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10747#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10746#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10745#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10744#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10743#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10742#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10741#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10740#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10739#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10738#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10737#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10736#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 10731#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10730#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 10725#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 10718#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10719#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10728#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10724#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10720#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10721#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10792#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10791#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10790#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10788#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10787#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10786#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10785#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10783#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10782#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10781#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10780#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10778#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10777#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10776#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10775#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10773#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10772#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10771#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10770#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10768#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10767#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10766#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10765#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10763#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10762#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10761#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10760#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10758#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10757#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10756#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10755#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10754#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10735#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10734#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10732#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10726#L517-3 [2024-11-09 15:31:04,329 INFO L747 eck$LassoCheckResult]: Loop: 10726#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10727#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 10726#L517-3 [2024-11-09 15:31:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash -112658418, now seen corresponding path program 21 times [2024-11-09 15:31:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653408386] [2024-11-09 15:31:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:04,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 21 times [2024-11-09 15:31:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080814898] [2024-11-09 15:31:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:04,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -890556141, now seen corresponding path program 10 times [2024-11-09 15:31:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505992237] [2024-11-09 15:31:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:04,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:11,418 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 360 DAG size of output: 266 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:31:11,692 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:11,692 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:11,692 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:11,692 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:11,692 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:31:11,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:11,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:11,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:11,692 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration25_Lasso [2024-11-09 15:31:11,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:11,692 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:11,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:11,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:12,713 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:31:12,713 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:31:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,717 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-09 15:31:12,718 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-09 15:31:12,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:12,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:12,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,748 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-09 15:31:12,749 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-09 15:31:12,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:12,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:12,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:12,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,773 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-09 15:31:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,775 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-09 15:31:12,775 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-09 15:31:12,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:12,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,797 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-09 15:31:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,799 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-09 15:31:12,800 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-09 15:31:12,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,833 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-09 15:31:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,836 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-09 15:31:12,837 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-09 15:31:12,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,859 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-09 15:31:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,861 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-09 15:31:12,861 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-09 15:31:12,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,884 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-09 15:31:12,885 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-09 15:31:12,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,906 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-09 15:31:12,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,908 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-09 15:31:12,909 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-09 15:31:12,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:12,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:12,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,932 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-09 15:31:12,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,934 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-09 15:31:12,935 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-09 15:31:12,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-09 15:31:12,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,956 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-09 15:31:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,958 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-09 15:31:12,959 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-09 15:31:12,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:12,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:12,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:12,982 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-09 15:31:12,983 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-09 15:31:12,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:12,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:12,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:12,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:12,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:12,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:12,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:12,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:12,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:13,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:13,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:13,008 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-09 15:31:13,010 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-09 15:31:13,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:13,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:13,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:13,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:13,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:13,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:13,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:13,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:31:13,035 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-09 15:31:13,035 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:31:13,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:13,036 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-09 15:31:13,037 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-09 15:31:13,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:31:13,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:31:13,048 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:31:13,048 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2024-11-09 15:31:13,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:13,081 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2024-11-09 15:31:13,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:31:13,083 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:31:13,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:31:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:13,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:31:13,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:13,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:13,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:13,484 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-09 15:31:13,484 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:31:13,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:13,520 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 84 states and 98 transitions. Complement of second has 5 states. [2024-11-09 15:31:13,521 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-09 15:31:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 69 letters. Loop has 2 letters. [2024-11-09 15:31:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:13,521 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:13,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:31:13,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:13,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:13,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:13,922 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-09 15:31:13,923 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:31:13,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:13,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 84 states and 98 transitions. Complement of second has 5 states. [2024-11-09 15:31:13,958 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-09 15:31:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 69 letters. Loop has 2 letters. [2024-11-09 15:31:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:13,959 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:14,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:31:14,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:14,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:14,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:14,365 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-09 15:31:14,366 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-11-09 15:31:14,366 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:14,706 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-09 15:31:14,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 107 states and 133 transitions. Complement of second has 29 states. [2024-11-09 15:31:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:31:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-09 15:31:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2024-11-09 15:31:14,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 69 letters. Loop has 2 letters. [2024-11-09 15:31:14,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:14,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 71 letters. Loop has 2 letters. [2024-11-09 15:31:14,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:14,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 69 letters. Loop has 4 letters. [2024-11-09 15:31:14,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:14,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 133 transitions. [2024-11-09 15:31:14,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:14,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 102 states and 126 transitions. [2024-11-09 15:31:14,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:31:14,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:31:14,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 126 transitions. [2024-11-09 15:31:14,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:14,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-11-09 15:31:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 126 transitions. [2024-11-09 15:31:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2024-11-09 15:31:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 87 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-09 15:31:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-09 15:31:14,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-09 15:31:14,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-09 15:31:14,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-09 15:31:14,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 102 transitions. [2024-11-09 15:31:14,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:14,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:14,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:14,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:14,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:14,731 INFO L745 eck$LassoCheckResult]: Stem: 11892#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11887#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 11882#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 11883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11884#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11886#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11919#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11918#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11917#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11916#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11915#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11914#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11913#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11912#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11911#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11910#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11909#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11908#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11907#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11906#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11905#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11904#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11903#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 11902#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11901#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 11896#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 11888#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11889#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11968#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11967#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11890#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11891#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11899#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11894#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11895#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11965#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11964#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11963#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11962#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11960#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11959#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11958#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11957#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11955#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11954#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11953#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11952#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11950#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11949#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11948#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11947#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11945#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11944#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11943#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11942#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11940#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11939#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11938#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11937#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11935#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11934#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11933#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11932#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11930#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11929#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11928#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11927#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11926#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11923#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11922#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11920#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11897#L517-3 [2024-11-09 15:31:14,731 INFO L747 eck$LassoCheckResult]: Loop: 11897#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11898#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 11897#L517-3 [2024-11-09 15:31:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1125960093, now seen corresponding path program 22 times [2024-11-09 15:31:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071193871] [2024-11-09 15:31:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 190 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071193871] [2024-11-09 15:31:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071193871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557049623] [2024-11-09 15:31:15,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:31:15,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:15,131 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:15,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2024-11-09 15:31:15,285 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:31:15,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:15,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 15:31:15,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:15,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557049623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:15,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-11-09 15:31:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067695754] [2024-11-09 15:31:15,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:15,922 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 22 times [2024-11-09 15:31:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561929862] [2024-11-09 15:31:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:15,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:15,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 15:31:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 15:31:15,960 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. cyclomatic complexity: 28 Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 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-09 15:31:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:16,147 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-11-09 15:31:16,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 173 transitions. [2024-11-09 15:31:16,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:16,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 91 states and 105 transitions. [2024-11-09 15:31:16,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:31:16,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:31:16,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2024-11-09 15:31:16,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:16,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-09 15:31:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2024-11-09 15:31:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-09 15:31:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 89 states have internal predecessors, (104), 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-09 15:31:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-11-09 15:31:16,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-09 15:31:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 15:31:16,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-09 15:31:16,151 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-09 15:31:16,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2024-11-09 15:31:16,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:16,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:16,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:16,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:16,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:16,152 INFO L745 eck$LassoCheckResult]: Stem: 12605#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12606#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 12599#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 12594#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 12595#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12596#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12597#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12598#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12600#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12636#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12635#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12634#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12633#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12632#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12631#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12630#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12629#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12628#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12627#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12626#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12625#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12624#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12623#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12622#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12621#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12620#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12619#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 12614#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12613#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 12608#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 12601#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12602#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12612#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12607#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12603#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12604#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12682#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12681#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12680#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12678#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12677#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12676#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12675#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12673#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12672#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12671#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12670#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12668#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12667#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12666#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12665#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12663#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12662#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12661#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12660#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12658#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12657#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12656#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12655#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12653#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12652#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12651#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12650#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12648#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12647#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12646#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12645#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12643#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12642#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12641#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12640#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12639#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12618#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12617#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12615#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12610#L517-3 [2024-11-09 15:31:16,152 INFO L747 eck$LassoCheckResult]: Loop: 12610#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12609#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 12610#L517-3 [2024-11-09 15:31:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash 859989697, now seen corresponding path program 23 times [2024-11-09 15:31:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254783968] [2024-11-09 15:31:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:16,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 23 times [2024-11-09 15:31:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850526147] [2024-11-09 15:31:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1816379142, now seen corresponding path program 11 times [2024-11-09 15:31:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722613547] [2024-11-09 15:31:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:16,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:25,583 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 388 DAG size of output: 286 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:31:26,165 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:26,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:26,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:26,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:26,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:31:26,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:26,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:26,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:26,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration27_Lasso [2024-11-09 15:31:26,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:26,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:26,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:26,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:27,404 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:31:27,404 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:31:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,406 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-09 15:31:27,407 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-09 15:31:27,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:27,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:27,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:27,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,431 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-09 15:31:27,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,435 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-09 15:31:27,436 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-09 15:31:27,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:27,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:27,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:27,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,460 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-09 15:31:27,461 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-09 15:31:27,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-09 15:31:27,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:27,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:27,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:27,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,483 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-09 15:31:27,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,485 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-09 15:31:27,485 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-09 15:31:27,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-09 15:31:27,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-11-09 15:31:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,516 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-09 15:31:27,517 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-09 15:31:27,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:27,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:27,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:27,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2024-11-09 15:31:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,541 INFO L229 MonitoredProcess]: Starting monitored process 198 with /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-09 15:31:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-11-09 15:31:27,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,569 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-09 15:31:27,570 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-09 15:31:27,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,613 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-09 15:31:27,614 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-09 15:31:27,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,647 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-09 15:31:27,648 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-09 15:31:27,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,678 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-09 15:31:27,678 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-09 15:31:27,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,708 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-09 15:31:27,709 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-09 15:31:27,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,742 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-09 15:31:27,743 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-09 15:31:27,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2024-11-09 15:31:27,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,780 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-09 15:31:27,785 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-09 15:31:27,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,811 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-09 15:31:27,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,813 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-09 15:31:27,814 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-09 15:31:27,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:27,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,840 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-09 15:31:27,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,842 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-09 15:31:27,843 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-09 15:31:27,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-09 15:31:27,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,868 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-09 15:31:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,870 INFO L229 MonitoredProcess]: Starting monitored process 208 with /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-09 15:31:27,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-11-09 15:31:27,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2024-11-09 15:31:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,898 INFO L229 MonitoredProcess]: Starting monitored process 209 with /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-09 15:31:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-11-09 15:31:27,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:27,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2024-11-09 15:31:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,925 INFO L229 MonitoredProcess]: Starting monitored process 210 with /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-09 15:31:27,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2024-11-09 15:31:27,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:31:27,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,954 INFO L229 MonitoredProcess]: Starting monitored process 211 with /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-09 15:31:27,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2024-11-09 15:31:27,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-09 15:31:27,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:27,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:27,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2024-11-09 15:31:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:27,986 INFO L229 MonitoredProcess]: Starting monitored process 212 with /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-09 15:31:27,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2024-11-09 15:31:27,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-09 15:31:27,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:27,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:27,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:27,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:27,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:27,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:28,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:28,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2024-11-09 15:31:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:28,013 INFO L229 MonitoredProcess]: Starting monitored process 213 with /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-09 15:31:28,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2024-11-09 15:31:28,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:28,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:28,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:28,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:28,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:28,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:28,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:28,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:31:28,039 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:31:28,039 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:31:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:28,043 INFO L229 MonitoredProcess]: Starting monitored process 214 with /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-09 15:31:28,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2024-11-09 15:31:28,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:31:28,064 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:31:28,065 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:31:28,065 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1 Supporting invariants [] [2024-11-09 15:31:28,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2024-11-09 15:31:28,111 INFO L156 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2024-11-09 15:31:28,114 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:31:28,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:31:28,115 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:31:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:28,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 15:31:28,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:28,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:28,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:28,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-09 15:31:28,614 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2024-11-09 15:31:28,614 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:28,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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 91 states and 106 transitions. Complement of second has 5 states. [2024-11-09 15:31:28,654 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-09 15:31:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:28,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 75 letters. Loop has 2 letters. [2024-11-09 15:31:28,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:28,655 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:28,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 15:31:28,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:29,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:29,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:29,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:29,407 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-09 15:31:29,407 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2024-11-09 15:31:29,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:29,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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 91 states and 106 transitions. Complement of second has 5 states. [2024-11-09 15:31:29,481 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-09 15:31:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 75 letters. Loop has 2 letters. [2024-11-09 15:31:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:29,481 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:29,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:29,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 15:31:29,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:30,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:30,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:30,060 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-09 15:31:30,060 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2024-11-09 15:31:30,060 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:30,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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 115 states and 143 transitions. Complement of second has 31 states. [2024-11-09 15:31:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:31:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-09 15:31:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2024-11-09 15:31:30,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 75 letters. Loop has 2 letters. [2024-11-09 15:31:30,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:30,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 77 letters. Loop has 2 letters. [2024-11-09 15:31:30,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:30,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 75 letters. Loop has 4 letters. [2024-11-09 15:31:30,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:30,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 143 transitions. [2024-11-09 15:31:30,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:30,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 110 states and 136 transitions. [2024-11-09 15:31:30,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:31:30,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:31:30,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 136 transitions. [2024-11-09 15:31:30,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:30,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-11-09 15:31:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 136 transitions. [2024-11-09 15:31:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-09 15:31:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 94 states have internal predecessors, (110), 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-09 15:31:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-09 15:31:30,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-09 15:31:30,415 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-09 15:31:30,415 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-09 15:31:30,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 110 transitions. [2024-11-09 15:31:30,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:30,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:30,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:30,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:30,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:30,421 INFO L745 eck$LassoCheckResult]: Stem: 13868#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 13863#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 13858#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 13859#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13860#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13861#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13862#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13897#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13896#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13895#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13894#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13893#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13892#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13891#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13890#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13889#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13888#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13887#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13886#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13884#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13882#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13881#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13880#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13879#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 13878#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13877#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 13872#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 13864#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13865#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13951#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13950#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13866#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13867#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13875#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13870#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13871#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13948#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13947#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13946#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13945#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13943#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13942#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13941#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13940#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13938#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13937#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13936#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13935#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13933#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13932#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13931#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13930#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13928#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13927#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13926#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13925#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13923#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13922#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13921#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13920#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13918#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13917#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13916#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13915#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13913#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13912#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13911#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13910#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13908#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13907#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13906#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13905#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13904#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13901#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13900#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13898#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13873#L517-3 [2024-11-09 15:31:30,421 INFO L747 eck$LassoCheckResult]: Loop: 13873#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13874#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 13873#L517-3 [2024-11-09 15:31:30,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1783632790, now seen corresponding path program 24 times [2024-11-09 15:31:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:30,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078178078] [2024-11-09 15:31:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 231 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078178078] [2024-11-09 15:31:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078178078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737265221] [2024-11-09 15:31:31,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:31:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:31,175 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:31,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (215)] Waiting until timeout for monitored process [2024-11-09 15:31:31,548 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-09 15:31:31,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:31,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 15:31:31,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:31,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737265221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:32,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 43 [2024-11-09 15:31:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290455905] [2024-11-09 15:31:32,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:32,353 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:32,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:32,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 24 times [2024-11-09 15:31:32,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:32,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343555196] [2024-11-09 15:31:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:32,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 15:31:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1467, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 15:31:32,397 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. cyclomatic complexity: 30 Second operand has 44 states, 43 states have (on average 3.186046511627907) internal successors, (137), 44 states have internal predecessors, (137), 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-09 15:31:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:32,608 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2024-11-09 15:31:32,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 187 transitions. [2024-11-09 15:31:32,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:32,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 98 states and 113 transitions. [2024-11-09 15:31:32,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:31:32,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:31:32,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 113 transitions. [2024-11-09 15:31:32,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:32,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 15:31:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 113 transitions. [2024-11-09 15:31:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-09 15:31:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 96 states have internal predecessors, (112), 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-09 15:31:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-09 15:31:32,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-09 15:31:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 15:31:32,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-09 15:31:32,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-09 15:31:32,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 112 transitions. [2024-11-09 15:31:32,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:32,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:32,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:32,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:32,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:32,614 INFO L745 eck$LassoCheckResult]: Stem: 14639#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 14633#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14628#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 14629#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14630#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14631#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14632#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14634#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14672#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14671#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14670#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14669#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14668#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14667#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14666#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14665#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14664#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14663#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14662#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14661#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14660#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14659#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14658#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14657#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14656#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14655#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14654#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14653#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 14648#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14647#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 14642#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 14635#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14636#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14646#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14641#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14637#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14638#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14723#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14722#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14721#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14719#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14718#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14717#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14716#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14714#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14713#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14712#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14711#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14709#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14708#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14707#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14706#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14704#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14703#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14702#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14701#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14699#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14698#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14697#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14696#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14694#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14693#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14692#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14691#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14689#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14688#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14687#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14686#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14684#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14683#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14682#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14681#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14679#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14678#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14677#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14676#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14675#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14652#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14651#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14649#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14643#L517-3 [2024-11-09 15:31:32,614 INFO L747 eck$LassoCheckResult]: Loop: 14643#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14644#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 14643#L517-3 [2024-11-09 15:31:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -183171724, now seen corresponding path program 25 times [2024-11-09 15:31:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:32,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229838573] [2024-11-09 15:31:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 25 times [2024-11-09 15:31:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937179310] [2024-11-09 15:31:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 65633529, now seen corresponding path program 12 times [2024-11-09 15:31:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830400605] [2024-11-09 15:31:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:32,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:46,302 WARN L286 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 416 DAG size of output: 306 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:31:46,831 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:31:46,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:31:46,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:31:46,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:31:46,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:31:46,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:46,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:31:46,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:31:46,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration29_Lasso [2024-11-09 15:31:46,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:31:46,832 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:31:46,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:46,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:47,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:47,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:31:48,161 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:31:48,161 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:31:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,191 INFO L229 MonitoredProcess]: Starting monitored process 216 with /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-09 15:31:48,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2024-11-09 15:31:48,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-09 15:31:48,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2024-11-09 15:31:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,217 INFO L229 MonitoredProcess]: Starting monitored process 217 with /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-09 15:31:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2024-11-09 15:31:48,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,242 INFO L229 MonitoredProcess]: Starting monitored process 218 with /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-09 15:31:48,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2024-11-09 15:31:48,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,267 INFO L229 MonitoredProcess]: Starting monitored process 219 with /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-09 15:31:48,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2024-11-09 15:31:48,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:48,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:48,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,296 INFO L229 MonitoredProcess]: Starting monitored process 220 with /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-09 15:31:48,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2024-11-09 15:31:48,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,320 INFO L229 MonitoredProcess]: Starting monitored process 221 with /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-09 15:31:48,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2024-11-09 15:31:48,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2024-11-09 15:31:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,344 INFO L229 MonitoredProcess]: Starting monitored process 222 with /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-09 15:31:48,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2024-11-09 15:31:48,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2024-11-09 15:31:48,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,369 INFO L229 MonitoredProcess]: Starting monitored process 223 with /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-09 15:31:48,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2024-11-09 15:31:48,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2024-11-09 15:31:48,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,394 INFO L229 MonitoredProcess]: Starting monitored process 224 with /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-09 15:31:48,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2024-11-09 15:31:48,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:48,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:48,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,419 INFO L229 MonitoredProcess]: Starting monitored process 225 with /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-09 15:31:48,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2024-11-09 15:31:48,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,445 INFO L229 MonitoredProcess]: Starting monitored process 226 with /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-09 15:31:48,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2024-11-09 15:31:48,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,469 INFO L229 MonitoredProcess]: Starting monitored process 227 with /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-09 15:31:48,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2024-11-09 15:31:48,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,493 INFO L229 MonitoredProcess]: Starting monitored process 228 with /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-09 15:31:48,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2024-11-09 15:31:48,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-09 15:31:48,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:48,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:48,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2024-11-09 15:31:48,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,519 INFO L229 MonitoredProcess]: Starting monitored process 229 with /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-09 15:31:48,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2024-11-09 15:31:48,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-09 15:31:48,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2024-11-09 15:31:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,545 INFO L229 MonitoredProcess]: Starting monitored process 230 with /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-09 15:31:48,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2024-11-09 15:31:48,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2024-11-09 15:31:48,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,568 INFO L229 MonitoredProcess]: Starting monitored process 231 with /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-09 15:31:48,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2024-11-09 15:31:48,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,594 INFO L229 MonitoredProcess]: Starting monitored process 232 with /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-09 15:31:48,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2024-11-09 15:31:48,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,618 INFO L229 MonitoredProcess]: Starting monitored process 233 with /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-09 15:31:48,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2024-11-09 15:31:48,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:31:48,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:31:48,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:31:48,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2024-11-09 15:31:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,643 INFO L229 MonitoredProcess]: Starting monitored process 234 with /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-09 15:31:48,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2024-11-09 15:31:48,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-09 15:31:48,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:48,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:48,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:31:48,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Ended with exit code 0 [2024-11-09 15:31:48,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,669 INFO L229 MonitoredProcess]: Starting monitored process 235 with /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-09 15:31:48,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2024-11-09 15:31:48,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-09 15:31:48,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:31:48,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:31:48,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:31:48,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:31:48,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:31:48,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:31:48,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:31:48,697 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:31:48,697 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:31:48,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:31:48,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:48,699 INFO L229 MonitoredProcess]: Starting monitored process 236 with /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-09 15:31:48,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2024-11-09 15:31:48,700 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:31:48,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:31:48,711 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:31:48,711 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 48))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 48))_1 Supporting invariants [] [2024-11-09 15:31:48,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2024-11-09 15:31:48,752 INFO L156 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2024-11-09 15:31:48,755 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:31:48,755 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:31:48,755 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-11-09 15:31:48,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:48,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:31:48,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:49,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:49,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:49,390 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-09 15:31:49,390 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.15 stem predicates 2 loop predicates [2024-11-09 15:31:49,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:49,431 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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) Result 98 states and 114 transitions. Complement of second has 5 states. [2024-11-09 15:31:49,431 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-09 15:31:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:49,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 81 letters. Loop has 2 letters. [2024-11-09 15:31:49,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:49,435 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:49,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:49,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:31:49,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:49,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:49,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:49,927 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-09 15:31:49,929 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.15 stem predicates 2 loop predicates [2024-11-09 15:31:49,929 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:49,968 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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) Result 98 states and 114 transitions. Complement of second has 5 states. [2024-11-09 15:31:49,969 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-09 15:31:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:31:49,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 81 letters. Loop has 2 letters. [2024-11-09 15:31:49,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:49,969 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:31:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:50,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:31:50,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:50,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2024-11-09 15:31:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:50,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:31:50,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:50,546 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-09 15:31:50,547 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.15 stem predicates 2 loop predicates [2024-11-09 15:31:50,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:50,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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) Result 123 states and 153 transitions. Complement of second has 33 states. [2024-11-09 15:31:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 15 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:31:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 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-09 15:31:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 95 transitions. [2024-11-09 15:31:50,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 95 transitions. Stem has 81 letters. Loop has 2 letters. [2024-11-09 15:31:50,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:50,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 95 transitions. Stem has 83 letters. Loop has 2 letters. [2024-11-09 15:31:50,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:50,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 95 transitions. Stem has 81 letters. Loop has 4 letters. [2024-11-09 15:31:50,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:31:50,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 153 transitions. [2024-11-09 15:31:50,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:50,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 118 states and 146 transitions. [2024-11-09 15:31:50,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:31:50,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:31:50,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2024-11-09 15:31:50,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:50,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-11-09 15:31:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2024-11-09 15:31:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2024-11-09 15:31:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 101 states have internal predecessors, (118), 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-09 15:31:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2024-11-09 15:31:50,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 118 transitions. [2024-11-09 15:31:50,922 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 118 transitions. [2024-11-09 15:31:50,922 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2024-11-09 15:31:50,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 118 transitions. [2024-11-09 15:31:50,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:50,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:50,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:50,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:50,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:50,923 INFO L745 eck$LassoCheckResult]: Stem: 15995#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 15990#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 15985#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 15986#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 15987#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 15988#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 15989#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16026#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16025#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16024#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16023#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16022#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16021#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16020#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16019#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16018#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16017#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16016#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16015#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16014#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16013#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16012#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16011#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16010#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16009#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16008#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16007#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16006#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16005#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16004#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 15999#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 15991#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15992#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16085#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16084#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 15993#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15994#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16002#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 15997#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 15998#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16082#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16081#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16080#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16079#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16077#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16076#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16075#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16074#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16072#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16071#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16070#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16069#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16067#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16066#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16065#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16064#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16062#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16061#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16060#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16059#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16057#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16056#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16055#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16054#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16052#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16051#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16050#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16049#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16047#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16046#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16045#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16044#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16042#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16041#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16040#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16039#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16037#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16036#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16035#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16034#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16033#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16030#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16029#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16027#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16000#L517-3 [2024-11-09 15:31:50,923 INFO L747 eck$LassoCheckResult]: Loop: 16000#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16001#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 16000#L517-3 [2024-11-09 15:31:50,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1350688567, now seen corresponding path program 26 times [2024-11-09 15:31:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:50,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888608227] [2024-11-09 15:31:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:31:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 276 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:31:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888608227] [2024-11-09 15:31:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888608227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:31:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777794070] [2024-11-09 15:31:51,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:31:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:31:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:31:51,409 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:31:51,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (237)] Waiting until timeout for monitored process [2024-11-09 15:31:51,584 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:31:51,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:31:51,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 15:31:51,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:31:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 325 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:52,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:31:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 325 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:31:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777794070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:31:52,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:31:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 46 [2024-11-09 15:31:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230138551] [2024-11-09 15:31:52,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:31:52,404 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:31:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 26 times [2024-11-09 15:31:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782042100] [2024-11-09 15:31:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:31:52,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 15:31:52,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1677, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 15:31:52,442 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. cyclomatic complexity: 32 Second operand has 47 states, 46 states have (on average 3.1956521739130435) internal successors, (147), 47 states have internal predecessors, (147), 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-09 15:31:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:31:52,713 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2024-11-09 15:31:52,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 201 transitions. [2024-11-09 15:31:52,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:52,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 105 states and 121 transitions. [2024-11-09 15:31:52,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:31:52,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-09 15:31:52,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 121 transitions. [2024-11-09 15:31:52,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:31:52,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 121 transitions. [2024-11-09 15:31:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 121 transitions. [2024-11-09 15:31:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-09 15:31:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.1538461538461537) internal successors, (120), 103 states have internal predecessors, (120), 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-09 15:31:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2024-11-09 15:31:52,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 120 transitions. [2024-11-09 15:31:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 15:31:52,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2024-11-09 15:31:52,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2024-11-09 15:31:52,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 120 transitions. [2024-11-09 15:31:52,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:31:52,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:31:52,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:31:52,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2024-11-09 15:31:52,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:31:52,717 INFO L745 eck$LassoCheckResult]: Stem: 16824#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16825#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 16818#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 16813#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 16814#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16815#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16816#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16817#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16819#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16859#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16858#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16857#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16856#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16855#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16854#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16853#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16852#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16851#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16850#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16849#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16848#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16847#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16846#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16845#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16844#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16843#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16842#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16841#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16840#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16839#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16838#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet9#1; 16833#L531-2 main_#t~post10#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 16832#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 16826#L531-4 havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 16820#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16821#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16830#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16827#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16822#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16823#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16915#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16914#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16913#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16911#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16910#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16909#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16908#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16906#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16905#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16904#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16903#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16901#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16900#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16899#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16898#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16896#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16895#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16894#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16893#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16891#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16890#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16889#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16888#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16886#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16885#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16884#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16883#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16881#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16880#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16879#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16878#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16876#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16875#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16874#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16873#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16871#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16870#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16869#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16868#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16866#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16865#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16864#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16863#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16862#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16837#L517-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 16836#L516-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 16834#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 16828#L517-3 [2024-11-09 15:31:52,717 INFO L747 eck$LassoCheckResult]: Loop: 16828#L517-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 16829#L517-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 16828#L517-3 [2024-11-09 15:31:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1263422425, now seen corresponding path program 27 times [2024-11-09 15:31:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861094018] [2024-11-09 15:31:52,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:52,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 27 times [2024-11-09 15:31:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:52,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127909254] [2024-11-09 15:31:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:52,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:31:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:31:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1326795500, now seen corresponding path program 13 times [2024-11-09 15:31:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:31:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166490810] [2024-11-09 15:31:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:31:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:31:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:31:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:31:52,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace