./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:19:37,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:19:37,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:19:37,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:19:37,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:19:38,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:19:38,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:19:38,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:19:38,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:19:38,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:19:38,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:19:38,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:19:38,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:19:38,068 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:19:38,068 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:19:38,068 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:19:38,068 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:19:38,069 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:19:38,069 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:19:38,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:19:38,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:19:38,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:19:38,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:19:38,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:19:38,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:19:38,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:19:38,079 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:19:38,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:19:38,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:19:38,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:19:38,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:19:38,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:19:38,080 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:19:38,086 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-10-25 00:19:38,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:19:38,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:19:38,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:19:38,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:19:38,547 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:19:38,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-25 00:19:40,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:19:40,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:19:40,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-25 00:19:40,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f8687d8/dda70ecfed3540ef85aed2cc502ce1a9/FLAG7e8c5648f [2024-10-25 00:19:40,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f8687d8/dda70ecfed3540ef85aed2cc502ce1a9 [2024-10-25 00:19:40,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:19:40,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:19:40,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:19:40,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:19:40,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:19:40,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b447a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40, skipping insertion in model container [2024-10-25 00:19:40,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:19:40,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:19:40,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:19:40,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:19:40,786 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:19:40,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40 WrapperNode [2024-10-25 00:19:40,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:19:40,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:19:40,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:19:40,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:19:40,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,832 INFO L138 Inliner]: procedures = 42, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2024-10-25 00:19:40,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:19:40,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:19:40,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:19:40,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:19:40,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,888 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-10-25 00:19:40,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:19:40,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:19:40,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:19:40,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:19:40,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (1/1) ... [2024-10-25 00:19:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:40,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:40,946 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-10-25 00:19:40,950 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-10-25 00:19:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:19:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:19:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:19:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:19:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:19:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:19:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:19:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:19:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:19:41,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:19:41,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:19:41,271 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-25 00:19:41,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:19:41,281 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:19:41,282 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-25 00:19:41,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:19:41 BoogieIcfgContainer [2024-10-25 00:19:41,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:19:41,283 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:19:41,283 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:19:41,286 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:19:41,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:19:41,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:19:40" (1/3) ... [2024-10-25 00:19:41,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34f157f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:19:41, skipping insertion in model container [2024-10-25 00:19:41,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:19:41,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:19:40" (2/3) ... [2024-10-25 00:19:41,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34f157f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:19:41, skipping insertion in model container [2024-10-25 00:19:41,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:19:41,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:19:41" (3/3) ... [2024-10-25 00:19:41,289 INFO L332 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-10-25 00:19:41,336 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:19:41,337 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:19:41,337 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:19:41,337 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:19:41,337 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:19:41,337 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:19:41,338 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:19:41,338 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:19:41,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 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-10-25 00:19:41,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-10-25 00:19:41,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:41,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:41,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:19:41,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:19:41,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:19:41,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 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-10-25 00:19:41,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-10-25 00:19:41,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:41,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:41,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-25 00:19:41,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:19:41,371 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 26#L87-3true [2024-10-25 00:19:41,372 INFO L747 eck$LassoCheckResult]: Loop: 26#L87-3true assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 6#L87-2true main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 26#L87-3true [2024-10-25 00:19:41,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-25 00:19:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383532357] [2024-10-25 00:19:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-25 00:19:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684573616] [2024-10-25 00:19:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-25 00:19:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015917010] [2024-10-25 00:19:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:41,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:41,982 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:41,982 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:41,983 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:41,983 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:41,983 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:41,983 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:41,983 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:41,983 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:41,983 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2024-10-25 00:19:41,983 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:41,984 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:42,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:42,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:42,537 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:42,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,545 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-10-25 00:19:42,549 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-10-25 00:19:42,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:42,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:42,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:42,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,593 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-10-25 00:19:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,601 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-10-25 00:19:42,605 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-10-25 00:19:42,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:42,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:42,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:42,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,635 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-10-25 00:19:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,638 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-10-25 00:19:42,639 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-10-25 00:19:42,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:42,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:42,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,667 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-10-25 00:19:42,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,670 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-10-25 00:19:42,670 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-10-25 00:19:42,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:42,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:42,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,702 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-10-25 00:19:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,704 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-10-25 00:19:42,705 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-10-25 00:19:42,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:42,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:42,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:42,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:19:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,732 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-10-25 00:19:42,733 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-10-25 00:19:42,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:42,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:42,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:42,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-25 00:19:42,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,760 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-10-25 00:19:42,761 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-10-25 00:19:42,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:42,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:42,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:42,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:42,791 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-10-25 00:19:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,793 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-10-25 00:19:42,794 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-10-25 00:19:42,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-10-25 00:19:42,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:42,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:42,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:42,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:42,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:42,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:42,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:42,831 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-25 00:19:42,831 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:19:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:42,851 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-10-25 00:19:42,853 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-10-25 00:19:42,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:42,866 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:42,866 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:42,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 13*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-25 00:19:42,880 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-10-25 00:19:42,907 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-25 00:19:42,927 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:19:42,934 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:19:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:42,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:42,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:42,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:42,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,041 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-10-25 00:19:43,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 111 transitions. Complement of second has 6 states. [2024-10-25 00:19:43,083 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-10-25 00:19:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2024-10-25 00:19:43,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-25 00:19:43,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:43,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-25 00:19:43,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:43,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-25 00:19:43,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:43,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 111 transitions. [2024-10-25 00:19:43,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-10-25 00:19:43,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 34 states and 49 transitions. [2024-10-25 00:19:43,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-25 00:19:43,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-25 00:19:43,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 49 transitions. [2024-10-25 00:19:43,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:43,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-25 00:19:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 49 transitions. [2024-10-25 00:19:43,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-25 00:19:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2024-10-25 00:19:43,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-25 00:19:43,114 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-25 00:19:43,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:19:43,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 49 transitions. [2024-10-25 00:19:43,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-10-25 00:19:43,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:43,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:43,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:43,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:43,115 INFO L745 eck$LassoCheckResult]: Stem: 197#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 180#L87-3 assume !(main_~i~1#1 < 7); 193#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 196#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 186#L63-4 [2024-10-25 00:19:43,116 INFO L747 eck$LassoCheckResult]: Loop: 186#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 168#L66 assume !parse_expression_list_#t~switch4#1; 169#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 187#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 188#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 186#L63-4 [2024-10-25 00:19:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2024-10-25 00:19:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414604528] [2024-10-25 00:19:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414604528] [2024-10-25 00:19:43,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414604528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:43,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:43,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:19:43,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458908961] [2024-10-25 00:19:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:43,172 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:43,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash 55474879, now seen corresponding path program 1 times [2024-10-25 00:19:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471597543] [2024-10-25 00:19:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:19:43,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:19:43,234 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:43,245 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2024-10-25 00:19:43,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2024-10-25 00:19:43,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2024-10-25 00:19:43,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-25 00:19:43,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-25 00:19:43,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2024-10-25 00:19:43,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:43,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-25 00:19:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2024-10-25 00:19:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-25 00:19:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-10-25 00:19:43,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-25 00:19:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:19:43,249 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-25 00:19:43,250 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:19:43,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2024-10-25 00:19:43,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:43,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:43,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:43,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:43,251 INFO L745 eck$LassoCheckResult]: Stem: 268#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 249#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 241#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 242#L87-3 assume !(main_~i~1#1 < 7); 264#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 267#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 256#L63-4 [2024-10-25 00:19:43,251 INFO L747 eck$LassoCheckResult]: Loop: 256#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 238#L66 assume !parse_expression_list_#t~switch4#1; 239#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 257#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 258#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 256#L63-4 [2024-10-25 00:19:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2024-10-25 00:19:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024852989] [2024-10-25 00:19:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024852989] [2024-10-25 00:19:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024852989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140282664] [2024-10-25 00:19:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:43,306 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:43,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-25 00:19:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:43,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 00:19:43,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140282664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:43,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-25 00:19:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947205956] [2024-10-25 00:19:43,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:43,379 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:43,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 55474879, now seen corresponding path program 2 times [2024-10-25 00:19:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047912549] [2024-10-25 00:19:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:19:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:19:43,456 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:43,484 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-10-25 00:19:43,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2024-10-25 00:19:43,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2024-10-25 00:19:43,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-25 00:19:43,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-25 00:19:43,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2024-10-25 00:19:43,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:43,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-10-25 00:19:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2024-10-25 00:19:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-25 00:19:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-10-25 00:19:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-10-25 00:19:43,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-10-25 00:19:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:19:43,494 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-10-25 00:19:43,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:19:43,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2024-10-25 00:19:43,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:43,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:43,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-10-25 00:19:43,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:43,497 INFO L745 eck$LassoCheckResult]: Stem: 382#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 363#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 355#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 356#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 378#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 388#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 387#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 386#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 385#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 384#L87-3 assume !(main_~i~1#1 < 7); 383#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 381#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 370#L63-4 [2024-10-25 00:19:43,498 INFO L747 eck$LassoCheckResult]: Loop: 370#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 352#L66 assume !parse_expression_list_#t~switch4#1; 353#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 371#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 372#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 370#L63-4 [2024-10-25 00:19:43,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 2 times [2024-10-25 00:19:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554515878] [2024-10-25 00:19:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554515878] [2024-10-25 00:19:43,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554515878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:43,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643706557] [2024-10-25 00:19:43,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:19:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:43,618 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:43,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-25 00:19:43,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-25 00:19:43,712 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:19:43,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:19:43,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:43,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643706557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:43,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-25 00:19:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972340076] [2024-10-25 00:19:43,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:43,767 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:43,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 55474879, now seen corresponding path program 3 times [2024-10-25 00:19:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956800606] [2024-10-25 00:19:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:43,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-25 00:19:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-10-25 00:19:43,819 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-10-25 00:19:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:43,843 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-10-25 00:19:43,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2024-10-25 00:19:43,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2024-10-25 00:19:43,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-25 00:19:43,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-25 00:19:43,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2024-10-25 00:19:43,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:43,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-25 00:19:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2024-10-25 00:19:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-25 00:19:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-10-25 00:19:43,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-25 00:19:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 00:19:43,848 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-25 00:19:43,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:19:43,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-10-25 00:19:43,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2024-10-25 00:19:43,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:43,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:43,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2024-10-25 00:19:43,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:43,849 INFO L745 eck$LassoCheckResult]: Stem: 547#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 528#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 520#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 521#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 544#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 559#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 558#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 557#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 556#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 555#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 554#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 553#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 552#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 551#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 550#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 549#L87-3 assume !(main_~i~1#1 < 7); 548#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 546#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 535#L63-4 [2024-10-25 00:19:43,849 INFO L747 eck$LassoCheckResult]: Loop: 535#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 517#L66 assume !parse_expression_list_#t~switch4#1; 518#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 536#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 537#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 535#L63-4 [2024-10-25 00:19:43,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 3 times [2024-10-25 00:19:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589181554] [2024-10-25 00:19:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash 55474879, now seen corresponding path program 4 times [2024-10-25 00:19:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198604176] [2024-10-25 00:19:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:43,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1772926460, now seen corresponding path program 1 times [2024-10-25 00:19:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725454571] [2024-10-25 00:19:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:43,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:47,124 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:47,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:47,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:47,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:47,124 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:47,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:47,125 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:47,125 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2024-10-25 00:19:47,125 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:47,125 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:47,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:47,690 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:47,690 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:47,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,692 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-10-25 00:19:47,693 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-10-25 00:19:47,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,720 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-10-25 00:19:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,723 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-10-25 00:19:47,724 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-10-25 00:19:47,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-10-25 00:19:47,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,754 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-10-25 00:19:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,755 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-10-25 00:19:47,756 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-10-25 00:19:47,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-25 00:19:47,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,786 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-10-25 00:19:47,788 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-10-25 00:19:47,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,825 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-10-25 00:19:47,828 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-10-25 00:19:47,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-10-25 00:19:47,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,853 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-10-25 00:19:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,855 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-10-25 00:19:47,858 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-10-25 00:19:47,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-25 00:19:47,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,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-10-25 00:19:47,907 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-10-25 00:19:47,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:47,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:47,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:47,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,938 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-10-25 00:19:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,943 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-10-25 00:19:47,956 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-10-25 00:19:47,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:47,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:47,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:47,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:47,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:47,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:47,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:47,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:47,995 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-10-25 00:19:47,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:47,998 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-10-25 00:19:48,004 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-10-25 00:19:48,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,039 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-10-25 00:19:48,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,044 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-10-25 00:19:48,051 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-10-25 00:19:48,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,086 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-10-25 00:19:48,087 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-10-25 00:19:48,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,120 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-10-25 00:19:48,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,123 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-10-25 00:19:48,124 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-10-25 00:19:48,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:48,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:48,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:48,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-25 00:19:48,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,156 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-10-25 00:19:48,157 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-10-25 00:19:48,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,194 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-10-25 00:19:48,195 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-10-25 00:19:48,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,237 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-10-25 00:19:48,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,239 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-10-25 00:19:48,240 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-10-25 00:19:48,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,272 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-10-25 00:19:48,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,274 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-10-25 00:19:48,275 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-10-25 00:19:48,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:48,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:48,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:48,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-25 00:19:48,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,308 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-10-25 00:19:48,309 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-10-25 00:19:48,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:48,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:48,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:48,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,350 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-10-25 00:19:48,352 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-10-25 00:19:48,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,391 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-10-25 00:19:48,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,393 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-10-25 00:19:48,394 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-10-25 00:19: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-10-25 00:19:48,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:48,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:48,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:48,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-25 00:19:48,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,425 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-10-25 00:19:48,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,433 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-10-25 00:19:48,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,465 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-10-25 00:19:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,467 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-10-25 00:19:48,468 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-10-25 00:19: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-10-25 00:19:48,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:48,501 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-10-25 00:19:48,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,503 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-10-25 00:19:48,505 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-10-25 00:19:48,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:48,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:48,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:48,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:48,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:48,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:48,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:48,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:48,573 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-25 00:19:48,573 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:19:48,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:48,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:48,575 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-10-25 00:19:48,576 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-10-25 00:19:48,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:48,590 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:48,591 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:48,591 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_2, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_2 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2024-10-25 00:19:48,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-25 00:19:48,640 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2024-10-25 00:19:48,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:19:48,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:19:48,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2024-10-25 00:19:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:48,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:48,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:48,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:48,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:48,803 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-25 00:19:48,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10-25 00:19:48,862 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 69 states and 88 transitions. Complement of second has 5 states. [2024-10-25 00:19:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-25 00:19:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10-25 00:19:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2024-10-25 00:19:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 19 letters. Loop has 5 letters. [2024-10-25 00:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 24 letters. Loop has 5 letters. [2024-10-25 00:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 19 letters. Loop has 10 letters. [2024-10-25 00:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:48,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2024-10-25 00:19:48,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:48,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 56 states and 72 transitions. [2024-10-25 00:19:48,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-25 00:19:48,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-25 00:19:48,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2024-10-25 00:19:48,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:48,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 72 transitions. [2024-10-25 00:19:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2024-10-25 00:19:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-25 00:19:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.290909090909091) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-10-25 00:19:48,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-25 00:19:48,871 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-25 00:19:48,871 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:19:48,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 71 transitions. [2024-10-25 00:19:48,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:48,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:48,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:48,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:48,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:19:48,872 INFO L745 eck$LassoCheckResult]: Stem: 821#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 794#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 783#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 784#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 817#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 833#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 832#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 831#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 830#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 829#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 828#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 827#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 826#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 825#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 824#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 823#L87-3 assume !(main_~i~1#1 < 7); 822#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 820#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 803#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 779#L66 assume parse_expression_list_#t~switch4#1; 782#L67-5 [2024-10-25 00:19:48,873 INFO L747 eck$LassoCheckResult]: Loop: 782#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 791#L67-1 assume parse_expression_list_#t~short7#1; 807#L67-3 assume !!parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1; 782#L67-5 [2024-10-25 00:19:48,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash 683017663, now seen corresponding path program 1 times [2024-10-25 00:19:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:48,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830324691] [2024-10-25 00:19:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:48,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:48,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:48,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2024-10-25 00:19:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971047858] [2024-10-25 00:19:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:48,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:48,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1775817142, now seen corresponding path program 1 times [2024-10-25 00:19:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899489912] [2024-10-25 00:19:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:19:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899489912] [2024-10-25 00:19:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899489912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:49,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:19:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705082024] [2024-10-25 00:19:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:19:49,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:19:49,259 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-10-25 00:19:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:49,378 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2024-10-25 00:19:49,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions. [2024-10-25 00:19:49,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:19:49,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 112 transitions. [2024-10-25 00:19:49,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:19:49,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:19:49,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2024-10-25 00:19:49,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:49,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 112 transitions. [2024-10-25 00:19:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2024-10-25 00:19:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2024-10-25 00:19:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 61 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-10-25 00:19:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2024-10-25 00:19:49,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 80 transitions. [2024-10-25 00:19:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:19:49,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 80 transitions. [2024-10-25 00:19:49,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:19:49,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 80 transitions. [2024-10-25 00:19:49,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:49,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:49,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:49,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:49,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:19:49,387 INFO L745 eck$LassoCheckResult]: Stem: 978#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 948#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 939#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 940#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 972#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 990#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 989#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 988#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 987#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 986#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 985#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 984#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 983#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 982#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 981#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 980#L87-3 assume !(main_~i~1#1 < 7); 979#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 977#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 957#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 958#L66 assume !parse_expression_list_#t~switch4#1; 934#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 960#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 961#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 959#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 933#L66 assume parse_expression_list_#t~switch4#1; 936#L67-5 [2024-10-25 00:19:49,387 INFO L747 eck$LassoCheckResult]: Loop: 936#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 945#L67-1 assume parse_expression_list_#t~short7#1; 994#L67-3 assume !!parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1; 936#L67-5 [2024-10-25 00:19:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1319689255, now seen corresponding path program 1 times [2024-10-25 00:19:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696181712] [2024-10-25 00:19:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2024-10-25 00:19:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403147644] [2024-10-25 00:19:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:49,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1267999006, now seen corresponding path program 1 times [2024-10-25 00:19:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929459081] [2024-10-25 00:19:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:49,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:50,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-25 00:19:53,702 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:53,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:53,703 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:53,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:53,703 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:53,703 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:53,703 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:53,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:53,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2024-10-25 00:19:53,703 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:53,703 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:53,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:53,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:54,399 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:54,399 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,403 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:54,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-25 00:19:54,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,431 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-10-25 00:19:54,432 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-10-25 00:19:54,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,461 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-10-25 00:19:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,463 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-10-25 00:19:54,466 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-10-25 00:19:54,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,493 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-10-25 00:19:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,495 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-10-25 00:19:54,501 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-10-25 00:19:54,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,539 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-10-25 00:19:54,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,542 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-10-25 00:19:54,544 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-10-25 00:19:54,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:54,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,576 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-10-25 00:19:54,580 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-10-25 00:19:54,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,609 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-10-25 00:19:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,612 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-10-25 00:19:54,613 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-10-25 00:19:54,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-25 00:19:54,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,645 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:54,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-25 00:19:54,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-25 00:19:54,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,677 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-10-25 00:19:54,680 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-10-25 00:19:54,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-25 00:19:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,710 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-10-25 00:19:54,711 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-10-25 00:19:54,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,742 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-10-25 00:19:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,744 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-10-25 00:19:54,746 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-10-25 00:19:54,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,776 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-10-25 00:19:54,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,778 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-10-25 00:19:54,779 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-10-25 00:19:54,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-10-25 00:19:54,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:54,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,811 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-10-25 00:19:54,813 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-10-25 00:19:54,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,841 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-10-25 00:19:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,843 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-10-25 00:19:54,844 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-10-25 00:19:54,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,868 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-10-25 00:19:54,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,870 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-10-25 00:19:54,871 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-10-25 00:19:54,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:54,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:54,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-25 00:19:54,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,900 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-10-25 00:19:54,900 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-10-25 00:19:54,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:54,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:54,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:54,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,925 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-10-25 00:19:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,927 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-25 00:19:54,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-10-25 00:19:54,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:54,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:54,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:54,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,954 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-10-25 00:19:54,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-10-25 00:19:54,963 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-10-25 00:19:54,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:54,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:54,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:54,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:54,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:54,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:54,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:54,995 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-10-25 00:19:54,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:54,997 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-10-25 00:19:54,998 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-10-25 00:19:54,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,033 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-10-25 00:19:55,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,035 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-10-25 00:19:55,036 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-10-25 00:19:55,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-10-25 00:19:55,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,066 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-10-25 00:19:55,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,068 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-10-25 00:19:55,069 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-10-25 00:19:55,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-25 00:19:55,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,097 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-10-25 00:19:55,098 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-10-25 00:19:55,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,124 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-10-25 00:19:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,126 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-10-25 00:19:55,127 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-10-25 00:19:55,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,138 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-25 00:19:55,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,139 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-25 00:19:55,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,154 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-10-25 00:19:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,156 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-10-25 00:19:55,157 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-10-25 00:19:55,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,182 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-10-25 00:19:55,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,184 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-10-25 00:19:55,185 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-10-25 00:19:55,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:55,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,212 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:55,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-25 00:19:55,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-10-25 00:19:55,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-25 00:19:55,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,262 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-10-25 00:19:55,266 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-10-25 00:19:55,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,314 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-10-25 00:19:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,318 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-10-25 00:19:55,324 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-10-25 00:19:55,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,361 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-10-25 00:19:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,363 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-10-25 00:19:55,364 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-10-25 00:19:55,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,393 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-10-25 00:19:55,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,395 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-10-25 00:19:55,396 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-10-25 00:19:55,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:55,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:55,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,432 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:19:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-25 00:19:55,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-10-25 00:19:55,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:55,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:55,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:55,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:55,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:55,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:55,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:55,473 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-25 00:19:55,473 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-25 00:19:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:55,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:55,478 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-10-25 00:19:55,481 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-10-25 00:19:55,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:55,495 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:55,495 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:55,495 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, ULTIMATE.start_parse_expression_list_~start~0#1, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset - 1*ULTIMATE.start_parse_expression_list_~start~0#1 + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 Supporting invariants [] [2024-10-25 00:19:55,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:55,541 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2024-10-25 00:19:55,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:19:55,542 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:19:55,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2024-10-25 00:19:55,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:55,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:55,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:55,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:19:55,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:55,641 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-10-25 00:19:55,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 80 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10-25 00:19:55,706 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 80 transitions. cyclomatic complexity: 22. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 165 states and 226 transitions. Complement of second has 7 states. [2024-10-25 00:19:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-25 00:19:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-10-25 00:19:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2024-10-25 00:19:55,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 26 letters. Loop has 3 letters. [2024-10-25 00:19:55,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:55,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 29 letters. Loop has 3 letters. [2024-10-25 00:19:55,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:55,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 26 letters. Loop has 6 letters. [2024-10-25 00:19:55,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:55,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 226 transitions. [2024-10-25 00:19:55,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:19:55,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 129 states and 174 transitions. [2024-10-25 00:19:55,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-25 00:19:55,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:19:55,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 174 transitions. [2024-10-25 00:19:55,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:55,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 174 transitions. [2024-10-25 00:19:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 174 transitions. [2024-10-25 00:19:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2024-10-25 00:19:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 87 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2024-10-25 00:19:55,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 119 transitions. [2024-10-25 00:19:55,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2024-10-25 00:19:55,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:19:55,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2024-10-25 00:19:55,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:55,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:55,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:55,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:55,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:19:55,730 INFO L745 eck$LassoCheckResult]: Stem: 1376#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1339#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1328#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1329#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1367#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1390#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1389#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1388#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1387#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1386#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1385#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1384#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1383#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1382#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1381#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1380#L87-3 assume !(main_~i~1#1 < 7); 1377#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1375#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1348#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 1349#L66 assume parse_expression_list_#t~switch4#1; 1398#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 1409#L67-1 assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1; 1407#L67-3 assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1; 1406#L67-6 call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1371#L66-1 assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1; 1342#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1331#L70-8 [2024-10-25 00:19:55,730 INFO L747 eck$LassoCheckResult]: Loop: 1331#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1346#L70-1 assume !parse_expression_list_#t~short14#1; 1330#L70-6 assume !!parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1; 1331#L70-8 [2024-10-25 00:19:55,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2040510092, now seen corresponding path program 1 times [2024-10-25 00:19:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265056904] [2024-10-25 00:19:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2024-10-25 00:19:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900187081] [2024-10-25 00:19:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900187081] [2024-10-25 00:19:55,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900187081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:55,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:55,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:19:55,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983351515] [2024-10-25 00:19:55,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:55,773 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:19:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:19:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:19:55,774 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:55,784 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2024-10-25 00:19:55,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2024-10-25 00:19:55,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:55,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 89 states and 119 transitions. [2024-10-25 00:19:55,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:19:55,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:19:55,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 119 transitions. [2024-10-25 00:19:55,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:55,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-25 00:19:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 119 transitions. [2024-10-25 00:19:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-25 00:19:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-10-25 00:19:55,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-25 00:19:55,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:19:55,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-25 00:19:55,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:19:55,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 119 transitions. [2024-10-25 00:19:55,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:55,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:55,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:55,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:55,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:55,794 INFO L745 eck$LassoCheckResult]: Stem: 1555#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1522#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1523#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1510#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1511#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1548#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1576#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1573#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1572#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1570#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1567#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1565#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1562#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1561#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1560#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1559#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1558#L87-3 assume !(main_~i~1#1 < 7); 1556#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1554#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1533#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 1506#L66 assume parse_expression_list_#t~switch4#1; 1508#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 1517#L67-1 assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1; 1538#L67-3 assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1; 1539#L67-6 call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1545#L66-1 assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1; 1526#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1515#L70-8 [2024-10-25 00:19:55,794 INFO L747 eck$LassoCheckResult]: Loop: 1515#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1531#L70-1 assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1; 1552#L70-2 assume parse_expression_list_#t~short13#1; 1542#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 1514#L70-6 assume !!parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1; 1515#L70-8 [2024-10-25 00:19:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2040510092, now seen corresponding path program 2 times [2024-10-25 00:19:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484433707] [2024-10-25 00:19:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:55,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2024-10-25 00:19:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272950039] [2024-10-25 00:19:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:55,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:55,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 907257627, now seen corresponding path program 1 times [2024-10-25 00:19:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:55,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042813556] [2024-10-25 00:19:55,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:55,937 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-10-25 00:19:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:19:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042813556] [2024-10-25 00:19:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042813556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:19:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935992793] [2024-10-25 00:19:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:19:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:19:56,056 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. cyclomatic complexity: 37 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:56,118 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2024-10-25 00:19:56,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 153 transitions. [2024-10-25 00:19:56,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:56,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 110 states and 140 transitions. [2024-10-25 00:19:56,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:19:56,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:19:56,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 140 transitions. [2024-10-25 00:19:56,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:56,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-10-25 00:19:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 140 transitions. [2024-10-25 00:19:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2024-10-25 00:19:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 92 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-10-25 00:19:56,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-10-25 00:19:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:19:56,125 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-10-25 00:19:56,125 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:19:56,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 121 transitions. [2024-10-25 00:19:56,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:19:56,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:56,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:56,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:56,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:56,127 INFO L745 eck$LassoCheckResult]: Stem: 1781#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 1746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 1747#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1735#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1736#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1773#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1822#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1821#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1820#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1818#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1817#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1816#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1815#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1813#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1811#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 1807#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1806#L87-3 assume !(main_~i~1#1 < 7); 1782#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 1780#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1757#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 1732#L66 assume !parse_expression_list_#t~switch4#1; 1733#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 1824#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 1823#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 1805#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 1803#L66 assume parse_expression_list_#t~switch4#1; 1799#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 1795#L67-1 assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1; 1762#L67-3 assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1; 1763#L67-6 call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 1776#L66-1 assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1; 1750#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1740#L70-8 [2024-10-25 00:19:56,127 INFO L747 eck$LassoCheckResult]: Loop: 1740#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1755#L70-1 assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1; 1778#L70-2 assume parse_expression_list_#t~short13#1; 1766#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 1739#L70-6 assume !!parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1; 1740#L70-8 [2024-10-25 00:19:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash -719184140, now seen corresponding path program 1 times [2024-10-25 00:19:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882656375] [2024-10-25 00:19:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2024-10-25 00:19:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089528863] [2024-10-25 00:19:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:56,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash -448118861, now seen corresponding path program 1 times [2024-10-25 00:19:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575944274] [2024-10-25 00:19:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:19:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575944274] [2024-10-25 00:19:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575944274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172250050] [2024-10-25 00:19:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:56,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:56,278 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:19:56,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-10-25 00:19:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:56,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:19:56,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:19:56,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:19:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172250050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:56,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-25 00:19:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612906506] [2024-10-25 00:19:56,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:19:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:19:56,509 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:56,604 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2024-10-25 00:19:56,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 214 transitions. [2024-10-25 00:19:56,605 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:19:56,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 149 states and 192 transitions. [2024-10-25 00:19:56,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-25 00:19:56,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-25 00:19:56,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 192 transitions. [2024-10-25 00:19:56,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:56,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 192 transitions. [2024-10-25 00:19:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 192 transitions. [2024-10-25 00:19:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2024-10-25 00:19:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 131 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:19:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 173 transitions. [2024-10-25 00:19:56,611 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 173 transitions. [2024-10-25 00:19:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-25 00:19:56,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 173 transitions. [2024-10-25 00:19:56,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:19:56,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 173 transitions. [2024-10-25 00:19:56,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:19:56,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:56,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:56,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:56,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:56,614 INFO L745 eck$LassoCheckResult]: Stem: 2275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 2240#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2228#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2229#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2267#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2323#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2322#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2321#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2317#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2316#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2315#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2314#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2313#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2311#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2308#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2307#L87-3 assume !(main_~i~1#1 < 7); 2276#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2274#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2250#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 2251#L66 assume !parse_expression_list_#t~switch4#1; 2327#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 2326#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2325#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2252#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 2225#L66 assume !parse_expression_list_#t~switch4#1; 2226#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 2253#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2254#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2305#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 2302#L66 assume parse_expression_list_#t~switch4#1; 2301#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 2297#L67-1 assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1; 2290#L67-3 assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1; 2286#L67-6 call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2281#L66-1 assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1; 2243#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2233#L70-8 [2024-10-25 00:19:56,614 INFO L747 eck$LassoCheckResult]: Loop: 2233#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 2248#L70-1 assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1; 2271#L70-2 assume parse_expression_list_#t~short13#1; 2259#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 2232#L70-6 assume !!parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1; 2233#L70-8 [2024-10-25 00:19:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2074560690, now seen corresponding path program 1 times [2024-10-25 00:19:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239463426] [2024-10-25 00:19:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2024-10-25 00:19:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822206660] [2024-10-25 00:19:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:56,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1107742617, now seen corresponding path program 1 times [2024-10-25 00:19:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209322247] [2024-10-25 00:19:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:56,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:20:02,016 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:20:02,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:20:02,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:20:02,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:20:02,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:20:02,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:20:02,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:20:02,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration11_Lasso [2024-10-25 00:20:02,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:20:02,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:20:02,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:20:02,810 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:20:02,811 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:20:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,813 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-10-25 00:20:02,814 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-10-25 00:20:02,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:02,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:02,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:20:02,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:02,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:02,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:02,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:20:02,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:20:02,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:02,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,848 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-10-25 00:20:02,848 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-10-25 00:20:02,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:02,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:02,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:02,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:02,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:02,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:02,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:02,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:02,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,879 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-10-25 00:20:02,880 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-10-25 00:20:02,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-10-25 00:20:02,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:02,892 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-25 00:20:02,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:02,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:02,894 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-25 00:20:02,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:02,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:02,910 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-10-25 00:20:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,918 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-10-25 00:20:02,918 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-10-25 00:20:02,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:02,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:02,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:02,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:02,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:02,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:02,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:02,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:02,954 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-10-25 00:20:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,956 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-10-25 00:20:02,957 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-10-25 00:20:02,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:02,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:02,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:02,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:02,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:02,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:02,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:02,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:02,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-25 00:20:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:02,990 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-10-25 00:20:02,991 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-10-25 00:20:02,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-10-25 00:20:03,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-25 00:20:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,020 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-10-25 00:20:03,021 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-10-25 00:20:03,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:03,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:20:03,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:20:03,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:20:03,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,052 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-10-25 00:20:03,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,053 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-10-25 00:20:03,055 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-10-25 00:20:03,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-10-25 00:20:03,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:20:03,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:20:03,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:20:03,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-25 00:20:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,084 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-10-25 00:20:03,085 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-10-25 00:20:03,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-10-25 00:20:03,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,111 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-10-25 00:20:03,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,113 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-10-25 00:20:03,114 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-10-25 00:20:03,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-10-25 00:20:03,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,140 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-10-25 00:20:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,142 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-10-25 00:20:03,143 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-10-25 00:20:03,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:03,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,168 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-10-25 00:20:03,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,170 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-10-25 00:20:03,171 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-10-25 00:20:03,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:03,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:20:03,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:03,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,202 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-10-25 00:20:03,203 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-10-25 00:20:03,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:20:03,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:20:03,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:20:03,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:20:03,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:20:03,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:20:03,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:20:03,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:20:03,248 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-10-25 00:20:03,248 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-25 00:20:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:20:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:20:03,253 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-10-25 00:20:03,253 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-10-25 00:20:03,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:20:03,268 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:20:03,268 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:20:03,268 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0#1) = 1*ULTIMATE.start_parse_expression_list_~j~0#1 Supporting invariants [] [2024-10-25 00:20:03,283 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-10-25 00:20:03,311 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2024-10-25 00:20:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:20:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:20:03,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:20:03,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:20:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:20:03,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:20:03,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:20:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:20:03,476 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-25 00:20:03,476 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 173 transitions. cyclomatic complexity: 51 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10-25 00:20:03,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 173 transitions. cyclomatic complexity: 51. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) Result 197 states and 256 transitions. Complement of second has 9 states. [2024-10-25 00:20:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:20:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10-25 00:20:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2024-10-25 00:20:03,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 37 letters. Loop has 5 letters. [2024-10-25 00:20:03,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:20:03,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 42 letters. Loop has 5 letters. [2024-10-25 00:20:03,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:20:03,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 37 letters. Loop has 10 letters. [2024-10-25 00:20:03,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:20:03,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 256 transitions. [2024-10-25 00:20:03,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:20:03,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 154 states and 198 transitions. [2024-10-25 00:20:03,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-25 00:20:03,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:20:03,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 198 transitions. [2024-10-25 00:20:03,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:20:03,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 198 transitions. [2024-10-25 00:20:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 198 transitions. [2024-10-25 00:20:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-10-25 00:20:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 137 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:20:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2024-10-25 00:20:03,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 180 transitions. [2024-10-25 00:20:03,578 INFO L425 stractBuchiCegarLoop]: Abstraction has 138 states and 180 transitions. [2024-10-25 00:20:03,578 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-25 00:20:03,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 180 transitions. [2024-10-25 00:20:03,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:20:03,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:20:03,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:20:03,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:20:03,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:20:03,583 INFO L745 eck$LassoCheckResult]: Stem: 2816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); 2773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; 2774#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2762#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2763#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2805#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2838#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2837#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2836#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2834#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2832#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2830#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2828#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2825#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2824#L87-3 assume !!(main_~i~1#1 < 7);havoc main_#t~nondet21#1;call write~int#1(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1; 2822#L87-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2821#L87-3 assume !(main_~i~1#1 < 7); 2817#L87-4 havoc main_~i~1#1;call write~int#1(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); 2815#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2784#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 2785#L66 assume parse_expression_list_#t~switch4#1; 2861#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 2859#L67-1 assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1; 2857#L67-3 assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1; 2855#L67-6 call parse_expression_list_#t~mem9#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); 2853#L66-1 assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1; 2852#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2851#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 2850#L70-1 assume !parse_expression_list_#t~short14#1; 2849#L70-6 assume !parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1; 2848#L70-9 parse_expression_list_#t~short17#1 := 0 < parse_expression_list_~j~0#1; 2847#L66-4 assume !parse_expression_list_#t~short17#1; 2846#L66-6 assume !parse_expression_list_#t~short17#1;havoc parse_expression_list_#t~mem16#1;havoc parse_expression_list_#t~short17#1; 2844#L66-8 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; 2842#r_strncpy_returnLabel#1 parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;havoc r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2840#L15 assume !(0 == __VERIFIER_assert_~cond#1); 2780#L15-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~int#2(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1); 2781#L66-9 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 2835#L65 havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1; 2833#L63-1 call parse_expression_list_#t~mem20#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1); 2831#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2829#L63-4 parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1; 2826#L66 assume parse_expression_list_#t~switch4#1; 2791#L67-5 [2024-10-25 00:20:03,585 INFO L747 eck$LassoCheckResult]: Loop: 2791#L67-5 call parse_expression_list_#t~mem5#1 := read~int#1(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1; 2823#L67-1 assume parse_expression_list_#t~short7#1; 2790#L67-3 assume !!parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1; 2791#L67-5 [2024-10-25 00:20:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:20:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1942624905, now seen corresponding path program 1 times [2024-10-25 00:20:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:20:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075931998] [2024-10-25 00:20:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:20:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:20:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:20:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-25 00:20:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:20:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075931998] [2024-10-25 00:20:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075931998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:20:03,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:20:03,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:20:03,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530904167] [2024-10-25 00:20:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:20:03,710 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:20:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:20:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2024-10-25 00:20:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:20:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689985119] [2024-10-25 00:20:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:20:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:20:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:20:03,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:20:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:20:03,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:20:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:20:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:20:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:20:03,767 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. cyclomatic complexity: 52 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10-25 00:20:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:20:03,801 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2024-10-25 00:20:03,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 126 transitions. [2024-10-25 00:20:03,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:20:03,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 0 states and 0 transitions. [2024-10-25 00:20:03,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:20:03,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:20:03,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:20:03,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:20:03,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:20:03,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:20:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:20:03,803 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:20:03,803 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-25 00:20:03,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:20:03,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:20:03,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:20:03,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:20:03 BoogieIcfgContainer [2024-10-25 00:20:03,810 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:20:03,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:20:03,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:20:03,811 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:20:03,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:19:41" (3/4) ... [2024-10-25 00:20:03,813 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:20:03,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:20:03,815 INFO L158 Benchmark]: Toolchain (without parser) took 23330.48ms. Allocated memory was 205.5MB in the beginning and 331.4MB in the end (delta: 125.8MB). Free memory was 136.4MB in the beginning and 139.6MB in the end (delta: -3.2MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,815 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:20:03,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.97ms. Allocated memory is still 205.5MB. Free memory was 136.0MB in the beginning and 122.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 205.5MB. Free memory was 122.5MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,815 INFO L158 Benchmark]: Boogie Preprocessor took 70.59ms. Allocated memory is still 205.5MB. Free memory was 120.5MB in the beginning and 118.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,815 INFO L158 Benchmark]: RCFGBuilder took 371.90ms. Allocated memory is still 205.5MB. Free memory was 118.0MB in the beginning and 99.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,816 INFO L158 Benchmark]: BuchiAutomizer took 22527.49ms. Allocated memory was 205.5MB in the beginning and 331.4MB in the end (delta: 125.8MB). Free memory was 99.5MB in the beginning and 140.7MB in the end (delta: -41.2MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,816 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 331.4MB. Free memory was 140.7MB in the beginning and 139.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:20:03,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.97ms. Allocated memory is still 205.5MB. Free memory was 136.0MB in the beginning and 122.5MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 205.5MB. Free memory was 122.5MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.59ms. Allocated memory is still 205.5MB. Free memory was 120.5MB in the beginning and 118.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.90ms. Allocated memory is still 205.5MB. Free memory was 118.0MB in the beginning and 99.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 22527.49ms. Allocated memory was 205.5MB in the beginning and 331.4MB in the end (delta: 125.8MB). Free memory was 99.5MB in the beginning and 140.7MB in the end (delta: -41.2MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 331.4MB. Free memory was 140.7MB in the beginning and 139.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~str!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~str!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function j and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 13 iterations. TraceHistogramMax:7. Analysis of lassos took 21.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 1101 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 721 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 472 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 380 mSDtfsCounter, 472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf100 lsp89 ukn63 mio100 lsp31 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:20:03,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:04,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:04,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:04,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-25 00:20:04,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE