./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:44:17,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:44:17,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:44:17,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:44:17,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:44:17,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:44:17,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:44:17,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:44:17,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:44:17,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:44:17,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:44:17,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:44:17,557 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:44:17,558 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:44:17,558 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:44:17,558 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:44:17,559 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:44:17,559 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:44:17,559 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:44:17,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:44:17,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:44:17,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:44:17,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:44:17,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:44:17,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:44:17,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:44:17,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:44:17,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:44:17,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:44:17,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:44:17,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:44:17,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:44:17,569 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:44:17,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:44:17,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:44:17,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:44:17,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:44:17,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:44:17,571 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:44:17,571 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-clean/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-clean/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 -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2024-10-12 00:44:17,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:44:17,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:44:17,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:44:17,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:44:17,843 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:44:17,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 00:44:19,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:44:19,541 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:44:19,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 00:44:19,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c93bb041/0b25540ed33c4caf897c82792f29c1fc/FLAG50b5db65a [2024-10-12 00:44:19,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c93bb041/0b25540ed33c4caf897c82792f29c1fc [2024-10-12 00:44:19,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:44:19,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:44:19,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:44:19,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:44:19,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:44:19,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15842abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19, skipping insertion in model container [2024-10-12 00:44:19,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:44:19,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:44:19,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:44:19,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:44:19,895 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:44:19,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19 WrapperNode [2024-10-12 00:44:19,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:44:19,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:44:19,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:44:19,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:44:19,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,933 INFO L138 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2024-10-12 00:44:19,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:44:19,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:44:19,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:44:19,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:44:19,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,975 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-12 00:44:19,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:19,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:44:19,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:44:19,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:44:19,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:44:19,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (1/1) ... [2024-10-12 00:44:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:20,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:20,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:44:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:44:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:44:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:44:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 00:44:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:44:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:44:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:44:20,161 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:44:20,163 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:44:20,435 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-10-12 00:44:20,435 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:44:20,452 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:44:20,452 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 00:44:20,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:44:20 BoogieIcfgContainer [2024-10-12 00:44:20,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:44:20,454 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:44:20,454 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:44:20,457 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:44:20,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:44:20,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:44:19" (1/3) ... [2024-10-12 00:44:20,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@438b5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:44:20, skipping insertion in model container [2024-10-12 00:44:20,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:44:20,458 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:44:19" (2/3) ... [2024-10-12 00:44:20,459 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@438b5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:44:20, skipping insertion in model container [2024-10-12 00:44:20,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:44:20,459 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:44:20" (3/3) ... [2024-10-12 00:44:20,460 INFO L332 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2024-10-12 00:44:20,515 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:44:20,515 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:44:20,515 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:44:20,515 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:44:20,516 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:44:20,516 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:44:20,516 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:44:20,517 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:44:20,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-12 00:44:20,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-10-12 00:44:20,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:20,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:20,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:44:20,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:44:20,541 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:44:20,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-12 00:44:20,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-10-12 00:44:20,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:20,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:20,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:44:20,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:44:20,551 INFO L745 eck$LassoCheckResult]: Stem: 33#$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); 9#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; 38#L90-3true [2024-10-12 00:44:20,551 INFO L747 eck$LassoCheckResult]: Loop: 38#L90-3true assume !!(main_~i~1#1 < 8);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; 35#L90-2true main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 38#L90-3true [2024-10-12 00:44:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:44:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879196641] [2024-10-12 00:44:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:20,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:44:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348851846] [2024-10-12 00:44:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:20,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:44:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327984726] [2024-10-12 00:44:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:20,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:21,067 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:44:21,068 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:44:21,068 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:44:21,068 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:44:21,069 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:44:21,069 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,069 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:44:21,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:44:21,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2024-10-12 00:44:21,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:44:21,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:44:21,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:21,487 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:44:21,491 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:44:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:44:21,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:21,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:21,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:21,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:21,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:44:21,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:44:21,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:21,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:21,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:21,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:21,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:44:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:44:21,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:21,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:21,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:21,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:44:21,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:44:21,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:21,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:21,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:21,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:44:21,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:44:21,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:21,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:21,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:21,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:21,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:44:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:44:21,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:21,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:21,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:21,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:21,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:21,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:44:21,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:21,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:21,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:21,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:21,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:21,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:21,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:21,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:44:21,859 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:44:21,859 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:44:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:21,892 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:21,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:44:21,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:44:21,919 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:44:21,919 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:44:21,919 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) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-12 00:44:21,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:21,951 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:44:21,959 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:44:21,960 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:44:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:21,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:44:21,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:22,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:44:22,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:22,046 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-12 00:44:22,080 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-12 00:44:22,082 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 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-12 00:44:22,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 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 76 states and 115 transitions. Complement of second has 6 states. [2024-10-12 00:44:22,147 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-12 00:44:22,151 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-12 00:44:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-10-12 00:44:22,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:44:22,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:22,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:44:22,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:22,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:44:22,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:22,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 115 transitions. [2024-10-12 00:44:22,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:44:22,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 35 states and 50 transitions. [2024-10-12 00:44:22,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-12 00:44:22,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 00:44:22,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2024-10-12 00:44:22,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:22,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-12 00:44:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2024-10-12 00:44:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-12 00:44:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2024-10-12 00:44:22,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-12 00:44:22,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-12 00:44:22,196 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:44:22,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2024-10-12 00:44:22,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:44:22,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:22,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:22,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:22,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:22,198 INFO L745 eck$LassoCheckResult]: Stem: 198#$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); 180#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; 181#L90-3 assume !(main_~i~1#1 < 8); 190#L90-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); 191#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 187#L63-4 [2024-10-12 00:44:22,198 INFO L747 eck$LassoCheckResult]: Loop: 187#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; 171#L66 assume !parse_expression_list_#t~switch4#1; 173#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; 188#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); 189#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 187#L63-4 [2024-10-12 00:44:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2024-10-12 00:44:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:22,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100149799] [2024-10-12 00:44:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:22,291 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-12 00:44:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100149799] [2024-10-12 00:44:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100149799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:44:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487482714] [2024-10-12 00:44:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:22,296 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 1 times [2024-10-12 00:44:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836863660] [2024-10-12 00:44:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:22,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:22,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:44:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:44:22,374 INFO L87 Difference]: Start difference. First operand 35 states and 50 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-12 00:44:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:22,389 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-10-12 00:44:22,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2024-10-12 00:44:22,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:22,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 43 transitions. [2024-10-12 00:44:22,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:44:22,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:44:22,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2024-10-12 00:44:22,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:22,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-12 00:44:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2024-10-12 00:44:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-12 00:44:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-12 00:44:22,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-12 00:44:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:44:22,396 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-12 00:44:22,396 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:44:22,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2024-10-12 00:44:22,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:22,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:22,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:22,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:22,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:22,397 INFO L745 eck$LassoCheckResult]: Stem: 271#$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); 251#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; 252#L90-3 assume !!(main_~i~1#1 < 8);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; 273#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 274#L90-3 assume !(main_~i~1#1 < 8); 262#L90-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); 263#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 259#L63-4 [2024-10-12 00:44:22,397 INFO L747 eck$LassoCheckResult]: Loop: 259#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; 243#L66 assume !parse_expression_list_#t~switch4#1; 245#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; 260#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); 261#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 259#L63-4 [2024-10-12 00:44:22,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2024-10-12 00:44:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980421622] [2024-10-12 00:44:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:22,480 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-12 00:44:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980421622] [2024-10-12 00:44:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980421622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:44:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752908135] [2024-10-12 00:44:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:44:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:22,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:44:22,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 00:44:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:22,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:44:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:22,556 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-12 00:44:22,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:44:22,578 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-12 00:44:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752908135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:44:22,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:44:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:44:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329376629] [2024-10-12 00:44:22,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:44:22,579 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 2 times [2024-10-12 00:44:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234514595] [2024-10-12 00:44:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:22,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:22,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:44:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:44:22,663 INFO L87 Difference]: Start difference. First operand 32 states and 42 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-12 00:44:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:22,696 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-12 00:44:22,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-10-12 00:44:22,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:22,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-10-12 00:44:22,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:44:22,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:44:22,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-10-12 00:44:22,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:22,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-12 00:44:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-10-12 00:44:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-12 00:44:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-12 00:44:22,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-12 00:44:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:44:22,706 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-12 00:44:22,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:44:22,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-10-12 00:44:22,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:22,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:22,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:22,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-10-12 00:44:22,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:22,708 INFO L745 eck$LassoCheckResult]: Stem: 387#$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); 367#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; 368#L90-3 assume !!(main_~i~1#1 < 8);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; 389#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 390#L90-3 assume !!(main_~i~1#1 < 8);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; 391#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 396#L90-3 assume !!(main_~i~1#1 < 8);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; 395#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 394#L90-3 assume !!(main_~i~1#1 < 8);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; 393#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 392#L90-3 assume !(main_~i~1#1 < 8); 378#L90-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); 379#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 375#L63-4 [2024-10-12 00:44:22,708 INFO L747 eck$LassoCheckResult]: Loop: 375#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; 359#L66 assume !parse_expression_list_#t~switch4#1; 361#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; 376#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); 377#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 375#L63-4 [2024-10-12 00:44:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 2 times [2024-10-12 00:44:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374866736] [2024-10-12 00:44:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:22,833 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-12 00:44:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374866736] [2024-10-12 00:44:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374866736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:44:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452626197] [2024-10-12 00:44:22,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:44:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:44:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:22,836 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:44:22,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 00:44:22,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:44:22,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:44:22,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:44:22,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:22,949 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-12 00:44:22,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:44:23,011 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-12 00:44:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452626197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:44:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:44:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 00:44:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31424671] [2024-10-12 00:44:23,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:44:23,012 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:23,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 3 times [2024-10-12 00:44:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759032363] [2024-10-12 00:44:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:44:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:44:23,084 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-12 00:44:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:23,126 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-12 00:44:23,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2024-10-12 00:44:23,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:23,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2024-10-12 00:44:23,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:44:23,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:44:23,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2024-10-12 00:44:23,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:23,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-12 00:44:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2024-10-12 00:44:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-12 00:44:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 45 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-12 00:44:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-12 00:44:23,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-12 00:44:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:44:23,135 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-12 00:44:23,135 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:44:23,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2024-10-12 00:44:23,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:44:23,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:23,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:23,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2024-10-12 00:44:23,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:23,137 INFO L745 eck$LassoCheckResult]: Stem: 557#$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); 537#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; 538#L90-3 assume !!(main_~i~1#1 < 8);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; 561#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 562#L90-3 assume !!(main_~i~1#1 < 8);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; 559#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 560#L90-3 assume !!(main_~i~1#1 < 8);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; 574#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 573#L90-3 assume !!(main_~i~1#1 < 8);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; 572#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 571#L90-3 assume !!(main_~i~1#1 < 8);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; 570#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 569#L90-3 assume !!(main_~i~1#1 < 8);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; 568#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 567#L90-3 assume !!(main_~i~1#1 < 8);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; 566#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 565#L90-3 assume !!(main_~i~1#1 < 8);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; 564#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 563#L90-3 assume !(main_~i~1#1 < 8); 548#L90-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); 549#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 545#L63-4 [2024-10-12 00:44:23,137 INFO L747 eck$LassoCheckResult]: Loop: 545#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; 529#L66 assume !parse_expression_list_#t~switch4#1; 531#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; 546#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); 547#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 545#L63-4 [2024-10-12 00:44:23,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 3 times [2024-10-12 00:44:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708908764] [2024-10-12 00:44:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:23,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 55628799, now seen corresponding path program 4 times [2024-10-12 00:44:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611444057] [2024-10-12 00:44:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 299274822, now seen corresponding path program 1 times [2024-10-12 00:44:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588023469] [2024-10-12 00:44:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:23,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:23,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:27,329 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:44:27,330 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:44:27,330 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:44:27,330 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:44:27,330 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:44:27,331 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:27,331 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:44:27,331 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:44:27,331 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2024-10-12 00:44:27,331 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:44:27,331 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:44:27,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:27,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:28,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:44:28,079 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:44:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:44:28,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:44:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,112 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:44:28,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:44:28,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:44:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,163 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:44:28,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,196 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:44:28,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:44:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:44:28,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,268 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:44:28,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:44:28,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:44:28,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:44:28,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,338 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:44:28,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:44:28,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,372 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:44:28,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:44:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,410 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:44:28,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:44:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,450 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:44:28,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:44:28,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,495 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:44:28,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:44:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,532 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:44:28,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,569 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:44:28,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,595 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:44:28,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,621 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:44:28,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:44:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,654 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:44:28,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:28,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:28,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:28,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:28,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,679 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:44:28,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:28,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,710 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:44:28,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:28,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:28,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:28,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:28,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:28,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:28,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:28,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:44:28,753 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:44:28,753 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:44:28,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:28,755 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:28,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:44:28,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:44:28,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:44:28,770 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:44:28,770 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2024-10-12 00:44:28,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:28,812 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2024-10-12 00:44:28,814 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:44:28,814 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:44:28,814 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2024-10-12 00:44:28,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:28,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:44:28,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:28,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:44:28,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:28,938 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-12 00:44:28,938 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-12 00:44:28,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:28,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:44:28,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 92 transitions. Complement of second has 4 states. [2024-10-12 00:44:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:44:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-10-12 00:44:28,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2024-10-12 00:44:28,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:28,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2024-10-12 00:44:28,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:28,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2024-10-12 00:44:28,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:28,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2024-10-12 00:44:28,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:28,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2024-10-12 00:44:28,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:44:28,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-12 00:44:28,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2024-10-12 00:44:28,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:28,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-10-12 00:44:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2024-10-12 00:44:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-10-12 00:44:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 57 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-12 00:44:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-10-12 00:44:28,995 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-10-12 00:44:28,995 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-10-12 00:44:28,995 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:44:28,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2024-10-12 00:44:28,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:28,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:28,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:28,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:28,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:44:28,996 INFO L745 eck$LassoCheckResult]: Stem: 837#$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); 809#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; 810#L90-3 assume !!(main_~i~1#1 < 8);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; 839#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 840#L90-3 assume !!(main_~i~1#1 < 8);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; 841#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 854#L90-3 assume !!(main_~i~1#1 < 8);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; 853#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 852#L90-3 assume !!(main_~i~1#1 < 8);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; 851#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 850#L90-3 assume !!(main_~i~1#1 < 8);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; 849#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 848#L90-3 assume !!(main_~i~1#1 < 8);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; 847#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 846#L90-3 assume !!(main_~i~1#1 < 8);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; 845#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 844#L90-3 assume !!(main_~i~1#1 < 8);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; 843#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 842#L90-3 assume !(main_~i~1#1 < 8); 823#L90-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); 824#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 819#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; 797#L66 assume parse_expression_list_#t~switch4#1; 799#L67-5 [2024-10-12 00:44:28,997 INFO L747 eck$LassoCheckResult]: Loop: 799#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; 807#L67-1 assume parse_expression_list_#t~short7#1; 827#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; 799#L67-5 [2024-10-12 00:44:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2024-10-12 00:44:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353698434] [2024-10-12 00:44:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:29,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2024-10-12 00:44:29,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:29,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853944436] [2024-10-12 00:44:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2024-10-12 00:44:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104089684] [2024-10-12 00:44:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104089684] [2024-10-12 00:44:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104089684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:29,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:44:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324571367] [2024-10-12 00:44:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:44:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:44:29,394 INFO L87 Difference]: Start difference. First operand 58 states and 74 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-12 00:44:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:29,513 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2024-10-12 00:44:29,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 116 transitions. [2024-10-12 00:44:29,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:44:29,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 116 transitions. [2024-10-12 00:44:29,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:44:29,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:44:29,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 116 transitions. [2024-10-12 00:44:29,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:29,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 116 transitions. [2024-10-12 00:44:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 116 transitions. [2024-10-12 00:44:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2024-10-12 00:44:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 64 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-10-12 00:44:29,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-10-12 00:44:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:44:29,521 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-10-12 00:44:29,521 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:44:29,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2024-10-12 00:44:29,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:29,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:29,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:29,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:29,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:44:29,523 INFO L745 eck$LassoCheckResult]: Stem: 1003#$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); 972#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; 973#L90-3 assume !!(main_~i~1#1 < 8);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; 1005#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1006#L90-3 assume !!(main_~i~1#1 < 8);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; 1007#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1020#L90-3 assume !!(main_~i~1#1 < 8);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; 1019#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1018#L90-3 assume !!(main_~i~1#1 < 8);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; 1017#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1016#L90-3 assume !!(main_~i~1#1 < 8);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; 1015#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1014#L90-3 assume !!(main_~i~1#1 < 8);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; 1013#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1012#L90-3 assume !!(main_~i~1#1 < 8);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; 1011#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1010#L90-3 assume !!(main_~i~1#1 < 8);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; 1009#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1008#L90-3 assume !(main_~i~1#1 < 8); 987#L90-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); 988#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 982#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; 983#L66 assume !parse_expression_list_#t~switch4#1; 961#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; 985#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); 986#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 984#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; 960#L67-5 [2024-10-12 00:44:29,523 INFO L747 eck$LassoCheckResult]: Loop: 960#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; 1022#L67-1 assume parse_expression_list_#t~short7#1; 1021#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; 960#L67-5 [2024-10-12 00:44:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -159704087, now seen corresponding path program 1 times [2024-10-12 00:44:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:29,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000651409] [2024-10-12 00:44:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:29,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2024-10-12 00:44:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065438565] [2024-10-12 00:44:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:29,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1079341024, now seen corresponding path program 1 times [2024-10-12 00:44:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917352990] [2024-10-12 00:44:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:29,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:33,359 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:44:33,359 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:44:33,359 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:44:33,359 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:44:33,359 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:44:33,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:33,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:44:33,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:44:33,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2024-10-12 00:44:33,360 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:44:33,360 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:44:33,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:33,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:34,115 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:44:34,116 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:44:34,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,117 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:34,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:44:34,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,148 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:44:34,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:44:34,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,173 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:44:34,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:44:34,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,209 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:44:34,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,246 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:44:34,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,284 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:44:34,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,312 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:44:34,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,336 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:44:34,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-12 00:44:34,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,361 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:44:34,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:44:34,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,389 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:44:34,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:34,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,420 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:44:34,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:34,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:44:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,450 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:44:34,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:34,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:34,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:34,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:34,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:34,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:44:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,476 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:44:34,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:34,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:34,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:34,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:34,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:34,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:34,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:34,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:44:34,524 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-10-12 00:44:34,524 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:44:34,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:34,527 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:34,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:44:34,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:44:34,541 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-12 00:44:34,542 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:44:34,542 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2, ULTIMATE.start_parse_expression_list_~start~0#1) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0#1 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str#1.offset >= 0] [2024-10-12 00:44:34,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:44:34,586 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 00:44:34,588 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:44:34,588 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:44:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:34,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:44:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:34,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:44:34,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:34,808 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-12 00:44:34,809 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:44:34,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:34,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 172 states and 233 transitions. Complement of second has 9 states. [2024-10-12 00:44:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:44:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2024-10-12 00:44:34,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-12 00:44:34,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:34,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 31 letters. Loop has 3 letters. [2024-10-12 00:44:34,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:34,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 28 letters. Loop has 6 letters. [2024-10-12 00:44:34,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:34,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 233 transitions. [2024-10-12 00:44:34,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 00:44:34,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 134 states and 179 transitions. [2024-10-12 00:44:34,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-12 00:44:34,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-12 00:44:34,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 179 transitions. [2024-10-12 00:44:34,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:34,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 179 transitions. [2024-10-12 00:44:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 179 transitions. [2024-10-12 00:44:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 91. [2024-10-12 00:44:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2024-10-12 00:44:34,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-10-12 00:44:34,949 INFO L425 stractBuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-10-12 00:44:34,949 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:44:34,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2024-10-12 00:44:34,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:34,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:34,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:34,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:34,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:44:34,952 INFO L745 eck$LassoCheckResult]: Stem: 1430#$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); 1393#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; 1394#L90-3 assume !!(main_~i~1#1 < 8);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; 1432#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1433#L90-3 assume !!(main_~i~1#1 < 8);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; 1434#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1449#L90-3 assume !!(main_~i~1#1 < 8);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; 1448#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1447#L90-3 assume !!(main_~i~1#1 < 8);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; 1446#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1445#L90-3 assume !!(main_~i~1#1 < 8);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; 1444#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1443#L90-3 assume !!(main_~i~1#1 < 8);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; 1442#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1441#L90-3 assume !!(main_~i~1#1 < 8);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; 1440#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1439#L90-3 assume !!(main_~i~1#1 < 8);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; 1438#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1437#L90-3 assume !(main_~i~1#1 < 8); 1408#L90-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); 1409#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1403#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; 1404#L66 assume parse_expression_list_#t~switch4#1; 1387#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; 1388#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; 1410#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; 1411#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); 1459#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; 1397#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1384#L70-8 [2024-10-12 00:44:34,952 INFO L747 eck$LassoCheckResult]: Loop: 1384#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1401#L70-1 assume !parse_expression_list_#t~short14#1; 1383#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; 1384#L70-8 [2024-10-12 00:44:34,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2024-10-12 00:44:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321842724] [2024-10-12 00:44:34,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:34,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:44:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321842724] [2024-10-12 00:44:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321842724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:44:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236705991] [2024-10-12 00:44:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:35,186 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2024-10-12 00:44:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461348202] [2024-10-12 00:44:35,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:44:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461348202] [2024-10-12 00:44:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461348202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:44:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428004621] [2024-10-12 00:44:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:35,197 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:44:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:35,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:44:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:44:35,198 INFO L87 Difference]: Start difference. First operand 91 states and 122 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-12 00:44:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:35,208 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2024-10-12 00:44:35,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2024-10-12 00:44:35,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:35,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2024-10-12 00:44:35,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:44:35,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:44:35,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2024-10-12 00:44:35,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:35,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-12 00:44:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2024-10-12 00:44:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-12 00:44:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.326086956521739) internal successors, (122), 91 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-12 00:44:35,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-12 00:44:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:44:35,223 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-12 00:44:35,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:44:35,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2024-10-12 00:44:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:35,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:35,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:35,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:35,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:35,228 INFO L745 eck$LassoCheckResult]: Stem: 1621#$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); 1585#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; 1586#L90-3 assume !!(main_~i~1#1 < 8);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; 1623#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1624#L90-3 assume !!(main_~i~1#1 < 8);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; 1626#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1657#L90-3 assume !!(main_~i~1#1 < 8);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; 1656#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1655#L90-3 assume !!(main_~i~1#1 < 8);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; 1654#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1653#L90-3 assume !!(main_~i~1#1 < 8);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; 1652#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1651#L90-3 assume !!(main_~i~1#1 < 8);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; 1650#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1649#L90-3 assume !!(main_~i~1#1 < 8);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; 1648#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1647#L90-3 assume !!(main_~i~1#1 < 8);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; 1646#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1645#L90-3 assume !(main_~i~1#1 < 8); 1601#L90-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); 1602#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1596#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; 1597#L66 assume parse_expression_list_#t~switch4#1; 1638#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; 1637#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; 1635#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; 1630#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); 1627#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; 1589#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1579#L70-8 [2024-10-12 00:44:35,228 INFO L747 eck$LassoCheckResult]: Loop: 1579#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1594#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; 1618#L70-2 assume parse_expression_list_#t~short13#1; 1607#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 1578#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; 1579#L70-8 [2024-10-12 00:44:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 2 times [2024-10-12 00:44:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245415634] [2024-10-12 00:44:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245415634] [2024-10-12 00:44:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245415634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:44:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440106070] [2024-10-12 00:44:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:35,552 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2024-10-12 00:44:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970140118] [2024-10-12 00:44:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:44:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:44:35,637 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:35,735 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2024-10-12 00:44:35,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 157 transitions. [2024-10-12 00:44:35,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-12 00:44:35,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 115 states and 149 transitions. [2024-10-12 00:44:35,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-10-12 00:44:35,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-12 00:44:35,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 149 transitions. [2024-10-12 00:44:35,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:35,738 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 149 transitions. [2024-10-12 00:44:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 149 transitions. [2024-10-12 00:44:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-10-12 00:44:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 87 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-12 00:44:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2024-10-12 00:44:35,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-10-12 00:44:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:44:35,743 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-10-12 00:44:35,743 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:44:35,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 116 transitions. [2024-10-12 00:44:35,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:35,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:35,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:35,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:35,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:35,745 INFO L745 eck$LassoCheckResult]: Stem: 1843#$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); 1810#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; 1811#L90-3 assume !!(main_~i~1#1 < 8);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; 1845#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1846#L90-3 assume !!(main_~i~1#1 < 8);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; 1848#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1862#L90-3 assume !!(main_~i~1#1 < 8);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; 1861#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1860#L90-3 assume !!(main_~i~1#1 < 8);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; 1859#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1858#L90-3 assume !!(main_~i~1#1 < 8);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; 1857#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1856#L90-3 assume !!(main_~i~1#1 < 8);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; 1855#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1854#L90-3 assume !!(main_~i~1#1 < 8);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; 1853#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1852#L90-3 assume !!(main_~i~1#1 < 8);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; 1851#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1850#L90-3 assume !(main_~i~1#1 < 8); 1826#L90-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); 1827#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 1821#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; 1799#L66 assume parse_expression_list_#t~switch4#1; 1800#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; 1808#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; 1828#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; 1829#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); 1835#L66-1 assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1; 1814#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 1806#L70-8 [2024-10-12 00:44:35,745 INFO L747 eck$LassoCheckResult]: Loop: 1806#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 1819#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; 1841#L70-2 assume parse_expression_list_#t~short13#1; 1832#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 1805#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; 1806#L70-8 [2024-10-12 00:44:35,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2024-10-12 00:44:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265815148] [2024-10-12 00:44:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2024-10-12 00:44:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849796149] [2024-10-12 00:44:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:35,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:35,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2024-10-12 00:44:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927774968] [2024-10-12 00:44:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:35,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927774968] [2024-10-12 00:44:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927774968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 00:44:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125069250] [2024-10-12 00:44:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:44:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:44:35,949 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. cyclomatic complexity: 35 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-12 00:44:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:36,020 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2024-10-12 00:44:36,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 147 transitions. [2024-10-12 00:44:36,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:36,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 110 states and 139 transitions. [2024-10-12 00:44:36,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:44:36,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:44:36,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 139 transitions. [2024-10-12 00:44:36,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:36,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 139 transitions. [2024-10-12 00:44:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 139 transitions. [2024-10-12 00:44:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-10-12 00:44:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 91 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-12 00:44:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2024-10-12 00:44:36,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 119 transitions. [2024-10-12 00:44:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:44:36,026 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2024-10-12 00:44:36,026 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:44:36,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2024-10-12 00:44:36,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:44:36,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:36,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:36,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:36,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:36,028 INFO L745 eck$LassoCheckResult]: Stem: 2064#$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); 2031#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; 2032#L90-3 assume !!(main_~i~1#1 < 8);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; 2066#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2067#L90-3 assume !!(main_~i~1#1 < 8);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; 2069#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2109#L90-3 assume !!(main_~i~1#1 < 8);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; 2108#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2107#L90-3 assume !!(main_~i~1#1 < 8);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; 2106#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2105#L90-3 assume !!(main_~i~1#1 < 8);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; 2104#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2103#L90-3 assume !!(main_~i~1#1 < 8);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; 2102#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2101#L90-3 assume !!(main_~i~1#1 < 8);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; 2099#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2096#L90-3 assume !!(main_~i~1#1 < 8);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; 2073#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2072#L90-3 assume !(main_~i~1#1 < 8); 2047#L90-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); 2048#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2042#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; 2020#L66 assume !parse_expression_list_#t~switch4#1; 2022#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; 2045#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); 2046#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2094#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; 2093#L66 assume parse_expression_list_#t~switch4#1; 2081#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; 2080#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; 2077#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; 2075#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); 2070#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; 2035#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2026#L70-8 [2024-10-12 00:44:36,028 INFO L747 eck$LassoCheckResult]: Loop: 2026#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 2040#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; 2062#L70-2 assume parse_expression_list_#t~short13#1; 2053#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 2025#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; 2026#L70-8 [2024-10-12 00:44:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1769863944, now seen corresponding path program 1 times [2024-10-12 00:44:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57033405] [2024-10-12 00:44:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:36,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,059 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2024-10-12 00:44:36,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164059430] [2024-10-12 00:44:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:36,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1463976913, now seen corresponding path program 1 times [2024-10-12 00:44:36,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976622856] [2024-10-12 00:44:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976622856] [2024-10-12 00:44:36,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976622856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:44:36,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362549116] [2024-10-12 00:44:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:44:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:36,153 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:44:36,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-10-12 00:44:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:36,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:44:36,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:36,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:44:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362549116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:44:36,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:44:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-12 00:44:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685926905] [2024-10-12 00:44:36,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:44:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:44:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:44:36,429 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 34 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-12 00:44:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:36,506 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2024-10-12 00:44:36,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 214 transitions. [2024-10-12 00:44:36,507 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:44:36,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 192 transitions. [2024-10-12 00:44:36,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-12 00:44:36,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-12 00:44:36,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 192 transitions. [2024-10-12 00:44:36,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:36,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 192 transitions. [2024-10-12 00:44:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 192 transitions. [2024-10-12 00:44:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2024-10-12 00:44:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.303030303030303) internal successors, (172), 131 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-12 00:44:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2024-10-12 00:44:36,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 172 transitions. [2024-10-12 00:44:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:44:36,516 INFO L425 stractBuchiCegarLoop]: Abstraction has 132 states and 172 transitions. [2024-10-12 00:44:36,516 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:44:36,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 172 transitions. [2024-10-12 00:44:36,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:44:36,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:36,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:36,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:44:36,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:44:36,518 INFO L745 eck$LassoCheckResult]: Stem: 2569#$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); 2536#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; 2537#L90-3 assume !!(main_~i~1#1 < 8);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; 2571#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2572#L90-3 assume !!(main_~i~1#1 < 8);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; 2574#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2641#L90-3 assume !!(main_~i~1#1 < 8);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; 2639#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2637#L90-3 assume !!(main_~i~1#1 < 8);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; 2635#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2634#L90-3 assume !!(main_~i~1#1 < 8);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; 2633#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2631#L90-3 assume !!(main_~i~1#1 < 8);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; 2629#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2628#L90-3 assume !!(main_~i~1#1 < 8);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; 2626#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2623#L90-3 assume !!(main_~i~1#1 < 8);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; 2579#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2578#L90-3 assume !(main_~i~1#1 < 8); 2552#L90-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); 2553#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 2547#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; 2525#L66 assume !parse_expression_list_#t~switch4#1; 2527#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; 2632#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); 2630#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2548#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; 2549#L66 assume !parse_expression_list_#t~switch4#1; 2600#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; 2550#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); 2551#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 2563#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; 2599#L66 assume parse_expression_list_#t~switch4#1; 2587#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; 2586#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; 2583#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; 2581#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); 2576#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; 2540#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 2531#L70-8 [2024-10-12 00:44:36,518 INFO L747 eck$LassoCheckResult]: Loop: 2531#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 2545#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; 2566#L70-2 assume parse_expression_list_#t~short13#1; 2557#L70-4 parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1; 2530#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; 2531#L70-8 [2024-10-12 00:44:36,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1800242060, now seen corresponding path program 2 times [2024-10-12 00:44:36,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635814917] [2024-10-12 00:44:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 4 times [2024-10-12 00:44:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911060001] [2024-10-12 00:44:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:36,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash 436075035, now seen corresponding path program 2 times [2024-10-12 00:44:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475451414] [2024-10-12 00:44:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:36,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:42,271 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 303 DAG size of output: 216 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:44:42,484 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:44:42,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:44:42,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:44:42,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:44:42,485 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:44:42,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:42,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:44:42,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:44:42,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2024-10-12 00:44:42,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:44:42,486 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:44:42,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:42,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:44:43,283 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:44:43,284 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:44:43,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,285 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:44:43,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,311 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:44:43,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:44:43,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,336 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:44:43,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-12 00:44:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,360 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:44:43,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:44:43,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,384 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:44:43,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:44:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,411 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:44:43,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,436 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:44:43,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,461 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:44:43,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:44:43,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,486 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:44:43,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:44:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,512 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:44:43,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:44:43,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,537 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:44:43,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 00:44:43,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,561 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:44:43,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,590 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:44:43,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:44:43,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,615 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:44:43,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:44:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,645 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:44:43,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-12 00:44:43,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,674 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:44:43,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 00:44:43,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,697 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:44:43,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:44:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,721 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:44:43,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:44:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,745 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:44:43,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-12 00:44:43,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,769 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:44:43,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,793 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:44:43,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-12 00:44:43,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:44:43,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,818 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:44:43,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:44:43,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,843 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:44:43,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,868 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:44:43,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,896 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:44:43,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,929 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 00:44:43,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:43,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:43,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:43,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-12 00:44:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,958 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 00:44:43,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-12 00:44:43,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:43,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:43,981 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:43,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 00:44:43,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:43,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:43,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:43,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:43,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:43,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:43,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:43,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:43,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,006 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 00:44:44,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:44,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:44:44,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:44:44,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:44:44,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-12 00:44:44,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,031 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 00:44:44,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:44,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,057 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-12 00:44:44,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:44,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-10-12 00:44:44,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,083 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-12 00:44:44,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:44,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:44,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,113 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-12 00:44:44,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:44:44,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,156 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-12 00:44:44,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-12 00:44:44,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-12 00:44:44,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,182 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-12 00:44:44,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:44,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:44:44,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-10-12 00:44:44,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,211 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 00:44:44,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-12 00:44:44,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:44:44,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:44:44,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:44:44,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:44:44,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:44:44,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:44:44,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:44:44,244 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:44:44,244 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:44:44,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:44:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:44:44,246 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:44:44,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 00:44:44,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:44:44,258 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:44:44,258 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:44:44,258 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-12 00:44:44,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-12 00:44:44,291 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2024-10-12 00:44:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:44,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:44:44,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:44,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:44:44,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:44:44,442 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-12 00:44:44,442 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-12 00:44:44,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50 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-12 00:44:44,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 172 transitions. cyclomatic complexity: 50. 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 202 states and 260 transitions. Complement of second has 9 states. [2024-10-12 00:44:44,515 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-12 00:44:44,516 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-12 00:44:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-10-12 00:44:44,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 39 letters. Loop has 5 letters. [2024-10-12 00:44:44,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:44,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 44 letters. Loop has 5 letters. [2024-10-12 00:44:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:44,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 39 letters. Loop has 10 letters. [2024-10-12 00:44:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:44:44,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 260 transitions. [2024-10-12 00:44:44,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:44:44,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 156 states and 199 transitions. [2024-10-12 00:44:44,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:44:44,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:44:44,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 199 transitions. [2024-10-12 00:44:44,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:44:44,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 199 transitions. [2024-10-12 00:44:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 199 transitions. [2024-10-12 00:44:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2024-10-12 00:44:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 137 states have internal predecessors, (179), 0 states have call successors, (0), 0 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-12 00:44:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2024-10-12 00:44:44,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 179 transitions. [2024-10-12 00:44:44,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 138 states and 179 transitions. [2024-10-12 00:44:44,527 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:44:44,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 179 transitions. [2024-10-12 00:44:44,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-12 00:44:44,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:44:44,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:44:44,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 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, 1] [2024-10-12 00:44:44,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:44:44,529 INFO L745 eck$LassoCheckResult]: Stem: 3122#$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); 3082#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; 3083#L90-3 assume !!(main_~i~1#1 < 8);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; 3124#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3125#L90-3 assume !!(main_~i~1#1 < 8);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; 3128#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3153#L90-3 assume !!(main_~i~1#1 < 8);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; 3152#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3151#L90-3 assume !!(main_~i~1#1 < 8);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; 3148#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3145#L90-3 assume !!(main_~i~1#1 < 8);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; 3142#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3139#L90-3 assume !!(main_~i~1#1 < 8);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; 3138#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3134#L90-3 assume !!(main_~i~1#1 < 8);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; 3133#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3132#L90-3 assume !!(main_~i~1#1 < 8);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; 3131#L90-2 main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3130#L90-3 assume !(main_~i~1#1 < 8); 3099#L90-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); 3100#L62 assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); 3094#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; 3095#L66 assume parse_expression_list_#t~switch4#1; 3170#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; 3169#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; 3168#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; 3167#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); 3166#L66-1 assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1; 3165#L66-3 parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; 3164#L70-8 parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1; 3163#L70-1 assume !parse_expression_list_#t~short14#1; 3162#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; 3161#L70-9 parse_expression_list_#t~short17#1 := 0 < parse_expression_list_~j~0#1; 3160#L66-4 assume !parse_expression_list_#t~short17#1; 3159#L66-6 assume !parse_expression_list_#t~short17#1;havoc parse_expression_list_#t~mem16#1;havoc parse_expression_list_#t~short17#1; 3158#L66-8 assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; 3157#L66-9 assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);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; 3156#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; 3155#L15 assume !(0 == __VERIFIER_assert_~cond#1); 3154#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); 3126#L66-10 parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1; 3127#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; 3150#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); 3147#L63-2 assume !!(0 != parse_expression_list_#t~mem20#1);havoc parse_expression_list_#t~mem20#1; 3144#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; 3140#L66 assume parse_expression_list_#t~switch4#1; 3102#L67-5 [2024-10-12 00:44:44,529 INFO L747 eck$LassoCheckResult]: Loop: 3102#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; 3137#L67-1 assume parse_expression_list_#t~short7#1; 3101#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; 3102#L67-5 [2024-10-12 00:44:44,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -457267248, now seen corresponding path program 1 times [2024-10-12 00:44:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65265382] [2024-10-12 00:44:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:44:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 00:44:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:44:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65265382] [2024-10-12 00:44:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65265382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:44:44,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:44:44,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:44:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581189551] [2024-10-12 00:44:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:44:44,635 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:44:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:44:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2024-10-12 00:44:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:44:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684104733] [2024-10-12 00:44:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:44:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:44:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:44,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:44:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:44:44,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:44:44,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:44:44,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:44:44,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:44:44,697 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. cyclomatic complexity: 51 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:44:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:44:44,729 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-10-12 00:44:44,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 125 transitions. [2024-10-12 00:44:44,729 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:44:44,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 0 states and 0 transitions. [2024-10-12 00:44:44,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:44:44,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:44:44,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:44:44,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:44:44,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:44,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:44:44,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:44:44,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:44:44,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:44:44,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:44:44,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:44:44,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:44:44 BoogieIcfgContainer [2024-10-12 00:44:44,735 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:44:44,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:44:44,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:44:44,736 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:44:44,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:44:20" (3/4) ... [2024-10-12 00:44:44,737 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:44:44,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:44:44,739 INFO L158 Benchmark]: Toolchain (without parser) took 25162.33ms. Allocated memory was 138.4MB in the beginning and 239.1MB in the end (delta: 100.7MB). Free memory was 81.6MB in the beginning and 110.3MB in the end (delta: -28.7MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,739 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:44:44,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.78ms. Allocated memory is still 138.4MB. Free memory was 81.6MB in the beginning and 68.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 138.4MB. Free memory was 68.2MB in the beginning and 66.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,739 INFO L158 Benchmark]: Boogie Preprocessor took 58.88ms. Allocated memory is still 138.4MB. Free memory was 66.3MB in the beginning and 63.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,740 INFO L158 Benchmark]: RCFGBuilder took 459.57ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 63.6MB in the beginning and 158.6MB in the end (delta: -95.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,740 INFO L158 Benchmark]: BuchiAutomizer took 24281.62ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 158.6MB in the beginning and 110.3MB in the end (delta: 48.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-10-12 00:44:44,740 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 239.1MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:44:44,741 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.17ms. Allocated memory is still 138.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.78ms. Allocated memory is still 138.4MB. Free memory was 81.6MB in the beginning and 68.2MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 138.4MB. Free memory was 68.2MB in the beginning and 66.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.88ms. Allocated memory is still 138.4MB. Free memory was 66.3MB in the beginning and 63.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.57ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 63.6MB in the beginning and 158.6MB in the end (delta: -95.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 24281.62ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 158.6MB in the beginning and 110.3MB in the end (delta: 48.3MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 239.1MB. Free memory is still 110.3MB. There was no memory consumed. 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (9 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 3 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function j and consists of 5 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.2s and 14 iterations. TraceHistogramMax:8. Analysis of lassos took 22.5s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 150 StatesRemovedByMinimization, 8 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, 363 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 1213 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638 IncrementalHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 406 mSDtfsCounter, 638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU5 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp89 ukn66 mio100 lsp31 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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-12 00:44:44,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-12 00:44:44,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:45,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:44:45,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 00:44:45,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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