./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:13:47,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:13:47,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-20 22:13:47,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:13:47,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:13:47,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:13:47,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:13:47,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:13:47,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:13:47,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:13:47,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:13:47,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:13:47,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:13:47,691 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:13:47,692 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:13:47,693 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:13:47,693 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:13:47,693 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:13:47,693 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:13:47,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:13:47,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:13:47,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:13:47,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:13:47,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:13:47,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:13:47,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:13:47,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:13:47,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:13:47,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:13:47,698 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:13:47,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:13:47,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:13:47,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:13:47,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:13:47,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:13:47,700 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:13:47,700 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc [2024-11-20 22:13:47,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:13:47,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:13:47,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:13:47,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:13:47,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:13:47,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2024-11-20 22:13:49,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:13:49,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:13:49,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2024-11-20 22:13:49,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fcb2ac8/8cff5d0fc3ea483f867c13e39166ffe7/FLAGd85b33122 [2024-11-20 22:13:49,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fcb2ac8/8cff5d0fc3ea483f867c13e39166ffe7 [2024-11-20 22:13:49,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:13:49,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:13:49,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:13:49,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:13:49,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:13:49,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:13:49" (1/1) ... [2024-11-20 22:13:49,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ce911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:49, skipping insertion in model container [2024-11-20 22:13:49,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:13:49" (1/1) ... [2024-11-20 22:13:50,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:13:50,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:13:50,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:13:50,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:13:50,456 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:13:50,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50 WrapperNode [2024-11-20 22:13:50,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:13:50,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:13:50,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:13:50,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:13:50,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,508 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 181 [2024-11-20 22:13:50,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:13:50,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:13:50,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:13:50,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:13:50,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,547 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2024-11-20 22:13:50,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:13:50,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:13:50,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:13:50,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:13:50,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (1/1) ... [2024-11-20 22:13:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:50,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:13:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:13:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:13:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:13:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:13:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:13:50,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:13:50,758 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:13:50,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:13:51,067 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-20 22:13:51,068 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:13:51,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:13:51,082 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-20 22:13:51,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:13:51 BoogieIcfgContainer [2024-11-20 22:13:51,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:13:51,083 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:13:51,084 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:13:51,087 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:13:51,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:13:51,088 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:13:49" (1/3) ... [2024-11-20 22:13:51,088 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22feb837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:13:51, skipping insertion in model container [2024-11-20 22:13:51,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:13:51,090 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:13:50" (2/3) ... [2024-11-20 22:13:51,091 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22feb837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:13:51, skipping insertion in model container [2024-11-20 22:13:51,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:13:51,091 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:13:51" (3/3) ... [2024-11-20 22:13:51,092 INFO L332 chiAutomizerObserver]: Analyzing ICFG strstr.i [2024-11-20 22:13:51,142 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:13:51,143 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:13:51,143 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:13:51,143 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:13:51,143 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:13:51,143 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:13:51,143 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:13:51,143 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:13:51,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:51,161 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2024-11-20 22:13:51,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:51,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:51,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:13:51,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:13:51,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:13:51,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:51,170 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2024-11-20 22:13:51,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:51,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:51,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:13:51,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:13:51,177 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 10#L542true assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3#L544-3true [2024-11-20 22:13:51,177 INFO L747 eck$LassoCheckResult]: Loop: 3#L544-3true assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 4#L544-2true main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3#L544-3true [2024-11-20 22:13:51,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-20 22:13:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525201835] [2024-11-20 22:13:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-20 22:13:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792317570] [2024-11-20 22:13:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-20 22:13:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981533980] [2024-11-20 22:13:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:51,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:51,644 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:13:51,645 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:13:51,645 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:13:51,645 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:13:51,645 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:13:51,645 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:51,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:13:51,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:13:51,646 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2024-11-20 22:13:51,646 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:13:51,646 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:13:51,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:51,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:52,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:13:52,151 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:13:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:13:52,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:52,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:52,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:52,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:13:52,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:52,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:52,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:52,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:52,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:13:52,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:52,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:52,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:52,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:13:52,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:13:52,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:52,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:52,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:52,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-20 22:13:52,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:13:52,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:52,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:52,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:52,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:13:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:13:52,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:52,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:52,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:13:52,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:13:52,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:52,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:52,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:13:52,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:52,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:52,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:52,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-20 22:13:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:13:52,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:52,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:52,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:52,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:52,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:52,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:52,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:52,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:13:52,522 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-20 22:13:52,522 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-20 22:13:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:52,546 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:52,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:13:52,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:13:52,562 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:13:52,563 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:13:52,563 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_1) = -1*ULTIMATE.start_main_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~hay~0#1.offset >= 0] [2024-11-20 22:13:52,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:13:52,587 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:13:52,599 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:13:52,600 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:13:52,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:52,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:13:52,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:52,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:13:52,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:52,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:13:52,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-20 22:13:52,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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) Result 78 states and 117 transitions. Complement of second has 6 states. [2024-11-20 22:13:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:13:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. 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-11-20 22:13:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-11-20 22:13:52,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-20 22:13:52,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:52,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-20 22:13:52,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:52,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-20 22:13:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:52,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 117 transitions. [2024-11-20 22:13:52,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-20 22:13:52,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 34 states and 48 transitions. [2024-11-20 22:13:52,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-20 22:13:52,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-20 22:13:52,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2024-11-20 22:13:52,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:13:52,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-20 22:13:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2024-11-20 22:13:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 22:13:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-20 22:13:52,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-20 22:13:52,866 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-20 22:13:52,866 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:13:52,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2024-11-20 22:13:52,867 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-20 22:13:52,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:52,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:52,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:13:52,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:13:52,868 INFO L745 eck$LassoCheckResult]: Stem: 209#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 189#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 177#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 178#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 185#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 181#L552-3 [2024-11-20 22:13:52,868 INFO L747 eck$LassoCheckResult]: Loop: 181#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 183#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 181#L552-3 [2024-11-20 22:13:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2024-11-20 22:13:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915536993] [2024-11-20 22:13:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:52,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:52,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2024-11-20 22:13:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670543626] [2024-11-20 22:13:52,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:52,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:52,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2024-11-20 22:13:52,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715857482] [2024-11-20 22:13:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:52,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:53,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:53,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-20 22:13:53,370 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:13:53,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:13:53,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:13:53,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:13:53,371 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:13:53,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:53,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:13:53,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:13:53,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2024-11-20 22:13:53,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:13:53,372 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:13:53,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:53,888 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:13:53,889 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:13:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:53,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:53,894 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:53,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:13:53,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-11-20 22:13:53,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:53,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:53,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:53,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:53,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:53,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:53,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:53,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:53,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:53,928 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:53,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:13:53,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-11-20 22:13:53,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:53,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:53,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:53,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:53,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:53,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:53,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:53,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-20 22:13:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:53,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:53,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:13:53,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:53,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:53,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:53,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:53,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:53,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:53,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:53,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:53,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:53,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:53,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:53,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:13:53,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:54,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:54,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:54,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:54,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:54,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:54,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:54,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:54,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:54,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:54,030 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:54,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:13:54,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:54,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:54,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:54,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:54,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:54,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:54,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:54,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:54,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:54,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:54,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:13:54,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:54,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:54,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:54,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:54,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:54,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:54,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:54,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:13:54,155 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-11-20 22:13:54,155 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-20 22:13:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:54,158 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:54,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:13:54,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:13:54,190 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:13:54,191 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:13:54,191 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~out_len~0#1, ULTIMATE.start_main_~i~3#1) = 1*ULTIMATE.start_main_~out_len~0#1 - 1*ULTIMATE.start_main_~i~3#1 Supporting invariants [] [2024-11-20 22:13:54,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-20 22:13:54,221 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-11-20 22:13:54,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:54,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:13:54,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:54,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:13:54,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:54,289 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:13:54,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 48 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:54,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 48 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 87 transitions. Complement of second has 6 states. [2024-11-20 22:13:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:13:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-11-20 22:13:54,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-20 22:13:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:54,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-20 22:13:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:54,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:13:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:54,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2024-11-20 22:13:54,326 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:54,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 35 states and 49 transitions. [2024-11-20 22:13:54,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-20 22:13:54,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-20 22:13:54,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2024-11-20 22:13:54,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:13:54,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-20 22:13:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2024-11-20 22:13:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 22:13:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2024-11-20 22:13:54,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-20 22:13:54,334 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-20 22:13:54,334 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:13:54,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 49 transitions. [2024-11-20 22:13:54,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:54,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:54,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:54,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:13:54,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:13:54,338 INFO L745 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 365#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 352#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 353#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 361#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 356#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 357#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 360#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 366#L510-4 [2024-11-20 22:13:54,338 INFO L747 eck$LassoCheckResult]: Loop: 366#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 367#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 376#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 366#L510-4 [2024-11-20 22:13:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2024-11-20 22:13:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047850668] [2024-11-20 22:13:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:54,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,395 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2024-11-20 22:13:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:54,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158524274] [2024-11-20 22:13:54,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:54,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:54,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2024-11-20 22:13:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837678666] [2024-11-20 22:13:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:13:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837678666] [2024-11-20 22:13:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837678666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:13:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:13:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 22:13:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882411913] [2024-11-20 22:13:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:13:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:13:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:13:54,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:13:54,847 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:13:54,917 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-20 22:13:54,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-20 22:13:54,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:54,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-20 22:13:54,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-20 22:13:54,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-20 22:13:54,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-20 22:13:54,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:13:54,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-20 22:13:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-20 22:13:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-20 22:13:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-20 22:13:54,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-20 22:13:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:13:54,924 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-20 22:13:54,924 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:13:54,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-11-20 22:13:54,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:54,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:54,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:54,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:13:54,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:13:54,925 INFO L745 eck$LassoCheckResult]: Stem: 477#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 454#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 442#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 443#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 452#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 446#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 447#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 451#L509 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 470#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 468#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 460#L510-10 [2024-11-20 22:13:54,926 INFO L747 eck$LassoCheckResult]: Loop: 460#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 461#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 463#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 460#L510-10 [2024-11-20 22:13:54,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2024-11-20 22:13:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:54,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213788213] [2024-11-20 22:13:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:13:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213788213] [2024-11-20 22:13:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213788213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:13:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:13:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:13:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925934746] [2024-11-20 22:13:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:13:54,990 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:13:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2024-11-20 22:13:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550738944] [2024-11-20 22:13:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:54,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:13:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:13:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:13:55,046 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:13:55,082 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-20 22:13:55,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2024-11-20 22:13:55,083 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:55,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2024-11-20 22:13:55,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-20 22:13:55,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-20 22:13:55,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2024-11-20 22:13:55,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:13:55,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-20 22:13:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2024-11-20 22:13:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-20 22:13:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-20 22:13:55,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-20 22:13:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:13:55,088 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-20 22:13:55,088 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:13:55,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2024-11-20 22:13:55,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:55,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:55,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:55,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:13:55,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:13:55,089 INFO L745 eck$LassoCheckResult]: Stem: 568#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 546#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 532#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 533#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 542#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 536#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 538#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 539#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 540#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 541#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 547#L510-4 [2024-11-20 22:13:55,089 INFO L747 eck$LassoCheckResult]: Loop: 547#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 548#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 556#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 547#L510-4 [2024-11-20 22:13:55,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2024-11-20 22:13:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544238450] [2024-11-20 22:13:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:55,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2024-11-20 22:13:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096172925] [2024-11-20 22:13:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2024-11-20 22:13:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006273918] [2024-11-20 22:13:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:55,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:55,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:13:55,857 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:13:55,857 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:13:55,857 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:13:55,857 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:13:55,857 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:13:55,858 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:55,858 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:13:55,858 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:13:55,858 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2024-11-20 22:13:55,858 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:13:55,858 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:13:55,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:55,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:56,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:56,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:56,409 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:13:56,409 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:13:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,411 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:13:56,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:13:56,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:13:56,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-20 22:13:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,476 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:13:56,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-20 22:13:56,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,505 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:13:56,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,533 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:13:56,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-11-20 22:13:56,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,563 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:13:56,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-20 22:13:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,592 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-20 22:13:56,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,623 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-20 22:13:56,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,650 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:13:56,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-11-20 22:13:56,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,683 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:13:56,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,712 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:13:56,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,741 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:13:56,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:56,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:56,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,772 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:13:56,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,803 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:13:56,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:56,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:56,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,831 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:13:56,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,859 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:13:56,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,887 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-20 22:13:56,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,916 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-20 22:13:56,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,944 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:13:56,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:56,975 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:56,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:13:56,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:56,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:56,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:56,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:56,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:56,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:56,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:56,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:56,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:56,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,000 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:13:57,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,027 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:13:57,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-20 22:13:57,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,055 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:13:57,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,078 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:13:57,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,099 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:13:57,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-20 22:13:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,129 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:13:57,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-20 22:13:57,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,153 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-20 22:13:57,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,176 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-20 22:13:57,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,199 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-20 22:13:57,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-20 22:13:57,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,223 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:13:57,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,244 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-20 22:13:57,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-20 22:13:57,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,263 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-20 22:13:57,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,283 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-20 22:13:57,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,304 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-20 22:13:57,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,328 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-20 22:13:57,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,348 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-20 22:13:57,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,368 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-20 22:13:57,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-20 22:13:57,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,388 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-20 22:13:57,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-20 22:13:57,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,407 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-20 22:13:57,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:57,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:57,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:57,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,430 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-20 22:13:57,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-20 22:13:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,456 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-20 22:13:57,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-20 22:13:57,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,485 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-20 22:13:57,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,511 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-20 22:13:57,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-11-20 22:13:57,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,523 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:13:57,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,526 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-20 22:13:57,527 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:13:57,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,546 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-20 22:13:57,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,583 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-20 22:13:57,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,618 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-20 22:13:57,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,647 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-20 22:13:57,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:57,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,674 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-20 22:13:57,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:57,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:57,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:57,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:57,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:57,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:13:57,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:13:57,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:13:57,714 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-20 22:13:57,714 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:13:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:57,715 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:57,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-20 22:13:57,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:13:57,727 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:13:57,728 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:13:57,728 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2024-11-20 22:13:57,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:57,753 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-20 22:13:57,756 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:13:57,756 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:13:57,756 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2024-11-20 22:13:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:57,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:13:57,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:57,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:13:57,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:13:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:57,879 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-20 22:13:57,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11-20 22:13:57,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) Result 45 states and 57 transitions. Complement of second has 7 states. [2024-11-20 22:13:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:13:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-11-20 22:13:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-20 22:13:57,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-20 22:13:57,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:57,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-20 22:13:57,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:57,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-20 22:13:57,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:13:57,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-20 22:13:57,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:13:57,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2024-11-20 22:13:57,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-20 22:13:57,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-20 22:13:57,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-20 22:13:57,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:13:57,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-20 22:13:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-20 22:13:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-20 22:13:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.275) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-20 22:13:57,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-20 22:13:57,933 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-20 22:13:57,933 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:13:57,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2024-11-20 22:13:57,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:13:57,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:57,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:57,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:13:57,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:13:57,934 INFO L745 eck$LassoCheckResult]: Stem: 753#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 729#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 730#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 716#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 717#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 726#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 720#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 721#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 725#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 731#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 732#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 751#L510-5 strlen_#res#1 := strlen_~i~0#1; 749#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 743#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 736#L510-10 [2024-11-20 22:13:57,934 INFO L747 eck$LassoCheckResult]: Loop: 736#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 737#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 741#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 736#L510-10 [2024-11-20 22:13:57,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2024-11-20 22:13:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690395219] [2024-11-20 22:13:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:57,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:57,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-20 22:13:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:57,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:57,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2024-11-20 22:13:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139907572] [2024-11-20 22:13:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:57,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:57,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:57,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:57,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2024-11-20 22:13:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995937756] [2024-11-20 22:13:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:13:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:13:58,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:13:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995937756] [2024-11-20 22:13:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995937756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:13:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:13:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 22:13:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613658484] [2024-11-20 22:13:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:13:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:13:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 22:13:58,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 22:13:58,290 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:13:58,430 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2024-11-20 22:13:58,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. [2024-11-20 22:13:58,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-20 22:13:58,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 93 transitions. [2024-11-20 22:13:58,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-20 22:13:58,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-20 22:13:58,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 93 transitions. [2024-11-20 22:13:58,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:13:58,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 93 transitions. [2024-11-20 22:13:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 93 transitions. [2024-11-20 22:13:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2024-11-20 22:13:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 59 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:13:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2024-11-20 22:13:58,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-11-20 22:13:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 22:13:58,436 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-11-20 22:13:58,436 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:13:58,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2024-11-20 22:13:58,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:13:58,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:13:58,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:13:58,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:13:58,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:13:58,437 INFO L745 eck$LassoCheckResult]: Stem: 888#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 863#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 850#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 852#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 853#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 854#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 861#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 890#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 905#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 906#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 896#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 895#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 894#L510-5 strlen_#res#1 := strlen_~i~0#1; 893#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 892#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 886#L510-10 [2024-11-20 22:13:58,437 INFO L747 eck$LassoCheckResult]: Loop: 886#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 891#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 885#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 886#L510-10 [2024-11-20 22:13:58,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2024-11-20 22:13:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:58,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630145094] [2024-11-20 22:13:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2024-11-20 22:13:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302596633] [2024-11-20 22:13:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:58,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:13:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2024-11-20 22:13:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:13:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227991007] [2024-11-20 22:13:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:13:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:13:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:13:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:13:58,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:13:59,390 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:13:59,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:13:59,390 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:13:59,390 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:13:59,390 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:13:59,390 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:59,390 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:13:59,390 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:13:59,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2024-11-20 22:13:59,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:13:59,391 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:13:59,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:13:59,942 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:13:59,942 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:13:59,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:59,945 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:59,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-20 22:13:59,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:59,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:59,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:59,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:59,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:59,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:59,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:59,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:59,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:59,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:59,975 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:13:59,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-20 22:13:59,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:13:59,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:13:59,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:13:59,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:13:59,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:13:59,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:13:59,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:13:59,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:13:59,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:13:59,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-20 22:13:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:13:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:13:59,999 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-20 22:14:00,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-20 22:14:00,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,020 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-20 22:14:00,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-20 22:14:00,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,039 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-20 22:14:00,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-20 22:14:00,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,061 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-20 22:14:00,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-20 22:14:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,081 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-20 22:14:00,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,105 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-20 22:14:00,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,129 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-20 22:14:00,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,151 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-20 22:14:00,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-20 22:14:00,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,172 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-20 22:14:00,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-20 22:14:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,192 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-20 22:14:00,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-20 22:14:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,213 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-20 22:14:00,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-20 22:14:00,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,234 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-20 22:14:00,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-20 22:14:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,254 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-20 22:14:00,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-20 22:14:00,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,273 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-20 22:14:00,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-20 22:14:00,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,300 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-20 22:14:00,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,324 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-20 22:14:00,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,350 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-20 22:14:00,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,375 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-20 22:14:00,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,398 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-20 22:14:00,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,420 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-20 22:14:00,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-20 22:14:00,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,443 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-20 22:14:00,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,463 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-20 22:14:00,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-20 22:14:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,482 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-20 22:14:00,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,504 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-20 22:14:00,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,525 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-20 22:14:00,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,551 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-20 22:14:00,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,570 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-20 22:14:00,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-20 22:14:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,591 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-20 22:14:00,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-20 22:14:00,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,611 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-20 22:14:00,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,630 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-20 22:14:00,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,650 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-20 22:14:00,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-20 22:14:00,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,669 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-20 22:14:00,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,689 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-20 22:14:00,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,711 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-20 22:14:00,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:00,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:00,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:00,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,732 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-20 22:14:00,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-20 22:14:00,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,753 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-20 22:14:00,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:00,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,774 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-20 22:14:00,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:00,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:00,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:00,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:00,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:00,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:00,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:00,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:00,803 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-20 22:14:00,803 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-20 22:14:00,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:00,804 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:00,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-20 22:14:00,805 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:00,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:14:00,816 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:00,817 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_4, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_4 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2024-11-20 22:14:00,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:00,840 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-20 22:14:00,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2024-11-20 22:14:00,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:14:00,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:14:00,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:00,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:14:00,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:00,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:14:00,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:00,981 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-20 22:14:00,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 99 transitions. Complement of second has 8 states. [2024-11-20 22:14:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:14:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-11-20 22:14:01,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 16 letters. Loop has 3 letters. [2024-11-20 22:14:01,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 19 letters. Loop has 3 letters. [2024-11-20 22:14:01,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 16 letters. Loop has 6 letters. [2024-11-20 22:14:01,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:01,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2024-11-20 22:14:01,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-20 22:14:01,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 94 transitions. [2024-11-20 22:14:01,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-11-20 22:14:01,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-20 22:14:01,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2024-11-20 22:14:01,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:01,059 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 94 transitions. [2024-11-20 22:14:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2024-11-20 22:14:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-11-20 22:14:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2024-11-20 22:14:01,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-20 22:14:01,062 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-20 22:14:01,062 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:14:01,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2024-11-20 22:14:01,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:01,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:01,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:01,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:01,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:01,063 INFO L745 eck$LassoCheckResult]: Stem: 1161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1134#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1119#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1120#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1132#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1124#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1125#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1176#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1169#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1159#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1160#L510-5 strlen_#res#1 := strlen_~i~0#1; 1157#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1151#L509-2 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 1152#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1141#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1135#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1136#L532-3 [2024-11-20 22:14:01,063 INFO L747 eck$LassoCheckResult]: Loop: 1136#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 1158#L533 assume !strstr_#t~short16#1; 1155#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 1156#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 1136#L532-3 [2024-11-20 22:14:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2024-11-20 22:14:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712721838] [2024-11-20 22:14:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712721838] [2024-11-20 22:14:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712721838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:14:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522194563] [2024-11-20 22:14:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:01,135 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:01,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2024-11-20 22:14:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767581076] [2024-11-20 22:14:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:01,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:01,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:01,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-20 22:14:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:14:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:14:01,274 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:01,305 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-11-20 22:14:01,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-20 22:14:01,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:01,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2024-11-20 22:14:01,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-20 22:14:01,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-20 22:14:01,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2024-11-20 22:14:01,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:01,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-20 22:14:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2024-11-20 22:14:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-20 22:14:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-11-20 22:14:01,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-20 22:14:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:14:01,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-20 22:14:01,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:14:01,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2024-11-20 22:14:01,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:01,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:01,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:01,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:01,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:01,312 INFO L745 eck$LassoCheckResult]: Stem: 1292#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1264#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1251#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1252#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1262#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1256#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1257#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1311#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1298#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1297#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1296#L510-5 strlen_#res#1 := strlen_~i~0#1; 1295#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1294#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1272#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1273#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1276#L510-11 strlen_#res#1 := strlen_~i~0#1; 1284#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1271#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1265#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1266#L532-3 [2024-11-20 22:14:01,312 INFO L747 eck$LassoCheckResult]: Loop: 1266#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 1290#L533 assume !strstr_#t~short16#1; 1287#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 1288#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 1266#L532-3 [2024-11-20 22:14:01,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2024-11-20 22:14:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329709640] [2024-11-20 22:14:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329709640] [2024-11-20 22:14:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329709640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:14:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399079204] [2024-11-20 22:14:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:01,393 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2024-11-20 22:14:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88585555] [2024-11-20 22:14:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:01,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:01,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:01,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:14:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:14:01,520 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:01,565 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-20 22:14:01,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 104 transitions. [2024-11-20 22:14:01,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:01,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 61 states and 72 transitions. [2024-11-20 22:14:01,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-20 22:14:01,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-20 22:14:01,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 72 transitions. [2024-11-20 22:14:01,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:01,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-11-20 22:14:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 72 transitions. [2024-11-20 22:14:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-20 22:14:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-20 22:14:01,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-20 22:14:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:14:01,575 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-20 22:14:01,575 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:14:01,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2024-11-20 22:14:01,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:01,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:01,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:01,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:01,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:01,577 INFO L745 eck$LassoCheckResult]: Stem: 1454#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1423#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1424#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1412#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1413#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1466#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1465#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 1464#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1463#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1462#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1444#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1427#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1428#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 1453#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 1429#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1430#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1452#L510-5 strlen_#res#1 := strlen_~i~0#1; 1458#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1457#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1432#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1433#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1438#L510-11 strlen_#res#1 := strlen_~i~0#1; 1445#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1431#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1425#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1426#L532-3 [2024-11-20 22:14:01,577 INFO L747 eck$LassoCheckResult]: Loop: 1426#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 1451#L533 assume !strstr_#t~short16#1; 1448#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 1449#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 1426#L532-3 [2024-11-20 22:14:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2024-11-20 22:14:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:01,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558505392] [2024-11-20 22:14:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:14:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558505392] [2024-11-20 22:14:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558505392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931453227] [2024-11-20 22:14:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:01,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:01,811 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:01,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2024-11-20 22:14:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:01,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 22:14:01,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:01,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-20 22:14:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:14:02,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:14:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931453227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:02,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 29 [2024-11-20 22:14:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782323820] [2024-11-20 22:14:02,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:02,433 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2024-11-20 22:14:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:02,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692616919] [2024-11-20 22:14:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:02,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:02,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 22:14:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2024-11-20 22:14:02,553 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. cyclomatic complexity: 18 Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 30 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:03,374 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2024-11-20 22:14:03,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 216 transitions. [2024-11-20 22:14:03,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2024-11-20 22:14:03,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 161 states and 191 transitions. [2024-11-20 22:14:03,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-20 22:14:03,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2024-11-20 22:14:03,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 191 transitions. [2024-11-20 22:14:03,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:03,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 191 transitions. [2024-11-20 22:14:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 191 transitions. [2024-11-20 22:14:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2024-11-20 22:14:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 77 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-20 22:14:03,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-20 22:14:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-20 22:14:03,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-20 22:14:03,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:14:03,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 92 transitions. [2024-11-20 22:14:03,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-20 22:14:03,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:03,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:03,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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-11-20 22:14:03,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:03,393 INFO L745 eck$LassoCheckResult]: Stem: 1919#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1887#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1873#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 1875#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 1876#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1877#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1883#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1878#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 1879#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 1880#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1881#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1882#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1888#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1889#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 1944#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 1941#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1914#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1915#L510-5 strlen_#res#1 := strlen_~i~0#1; 1937#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1936#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1893#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1894#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 1898#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 1895#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 1896#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 1897#L510-11 strlen_#res#1 := strlen_~i~0#1; 1907#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1892#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1884#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1885#L532-3 [2024-11-20 22:14:03,393 INFO L747 eck$LassoCheckResult]: Loop: 1885#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 1913#L533 assume !strstr_#t~short16#1; 1910#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 1911#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 1885#L532-3 [2024-11-20 22:14:03,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2024-11-20 22:14:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407870098] [2024-11-20 22:14:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:03,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2024-11-20 22:14:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379898216] [2024-11-20 22:14:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:03,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2024-11-20 22:14:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:03,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022214939] [2024-11-20 22:14:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:03,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:05,099 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:14:05,099 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:14:05,099 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:14:05,099 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:14:05,099 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:14:05,099 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,099 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:14:05,099 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:14:05,099 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2024-11-20 22:14:05,099 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:14:05,099 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:14:05,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:05,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:14:05,830 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:14:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,833 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-20 22:14:05,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-11-20 22:14:05,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,854 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-20 22:14:05,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-20 22:14:05,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,874 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-20 22:14:05,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-20 22:14:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,894 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-20 22:14:05,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-20 22:14:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,913 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-20 22:14:05,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-11-20 22:14:05,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,934 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-20 22:14:05,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-20 22:14:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,954 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-20 22:14:05,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:05,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,974 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-20 22:14:05,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:05,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:05,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:05,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:05,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:05,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:05,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:05,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:05,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:05,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-20 22:14:05,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:05,994 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-20 22:14:05,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-20 22:14:06,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,013 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-20 22:14:06,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-20 22:14:06,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,046 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-20 22:14:06,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-20 22:14:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,066 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-20 22:14:06,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-20 22:14:06,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,086 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-20 22:14:06,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-20 22:14:06,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,106 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-20 22:14:06,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-20 22:14:06,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,127 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-20 22:14:06,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:06,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:06,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:06,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-20 22:14:06,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,147 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-20 22:14:06,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-11-20 22:14:06,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:06,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:06,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-20 22:14:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,172 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-20 22:14:06,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,184 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-20 22:14:06,184 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:14:06,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,199 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-20 22:14:06,199 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:14:06,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:06,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,238 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-20 22:14:06,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:06,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:06,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:06,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,269 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-20 22:14:06,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:06,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:06,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:06,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:06,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:06,317 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-20 22:14:06,318 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-20 22:14:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:06,320 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:06,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-20 22:14:06,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:06,337 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:14:06,337 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:06,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset) = -2*ULTIMATE.start_strstr_~haystack#1.offset + 3 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_1 + 2 >= 0] [2024-11-20 22:14:06,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:06,373 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-20 22:14:06,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2024-11-20 22:14:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:06,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 22:14:06,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:06,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-20 22:14:06,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 22:14:06,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 22:14:06,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 22:14:06,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 22:14:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:06,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:14:06,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:06,774 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 3 loop predicates [2024-11-20 22:14:06,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 92 transitions. cyclomatic complexity: 21 Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:06,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 92 transitions. cyclomatic complexity: 21. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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 140 states and 171 transitions. Complement of second has 14 states. [2024-11-20 22:14:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-20 22:14:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2024-11-20 22:14:06,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 30 letters. Loop has 4 letters. [2024-11-20 22:14:06,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:06,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-20 22:14:06,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:06,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 30 letters. Loop has 8 letters. [2024-11-20 22:14:06,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:06,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 171 transitions. [2024-11-20 22:14:06,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:14:06,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 165 transitions. [2024-11-20 22:14:06,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-20 22:14:06,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-11-20 22:14:06,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 165 transitions. [2024-11-20 22:14:06,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:06,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-20 22:14:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 165 transitions. [2024-11-20 22:14:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-20 22:14:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.2030075187969924) internal successors, (160), 132 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-20 22:14:06,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-20 22:14:06,949 INFO L425 stractBuchiCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-20 22:14:06,949 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-20 22:14:06,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 160 transitions. [2024-11-20 22:14:06,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:14:06,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:06,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:06,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [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, 1, 1] [2024-11-20 22:14:06,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:06,952 INFO L745 eck$LassoCheckResult]: Stem: 2356#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2314#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2301#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 2303#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2420#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2418#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2416#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2415#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 2411#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 2410#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2408#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2406#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2404#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2402#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 2400#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 2398#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2387#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 2427#L510-5 strlen_#res#1 := strlen_~i~0#1; 2426#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2421#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2323#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2324#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 2354#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 2325#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2326#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 2367#L510-11 strlen_#res#1 := strlen_~i~0#1; 2366#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2365#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2364#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2359#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 2352#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2341#L518-3 [2024-11-20 22:14:06,952 INFO L747 eck$LassoCheckResult]: Loop: 2341#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2357#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 2340#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 2341#L518-3 [2024-11-20 22:14:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2024-11-20 22:14:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679908852] [2024-11-20 22:14:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:06,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:06,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2024-11-20 22:14:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751512619] [2024-11-20 22:14:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:07,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:07,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2024-11-20 22:14:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806617168] [2024-11-20 22:14:07,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:07,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:07,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:07,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-11-20 22:14:10,308 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:14:10,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:14:10,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:14:10,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:14:10,309 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:14:10,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:10,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:14:10,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:14:10,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2024-11-20 22:14:10,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:14:10,309 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:14:10,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:10,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:11,533 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:14:11,533 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:14:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,536 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-20 22:14:11,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-11-20 22:14:11,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,557 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-20 22:14:11,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,577 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-20 22:14:11,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,599 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-20 22:14:11,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,619 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-20 22:14:11,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:11,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:11,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-20 22:14:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,643 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-20 22:14:11,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-20 22:14:11,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,663 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-20 22:14:11,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-20 22:14:11,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,683 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-20 22:14:11,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-11-20 22:14:11,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,703 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-20 22:14:11,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-20 22:14:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,723 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-20 22:14:11,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-20 22:14:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,742 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-20 22:14:11,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-20 22:14:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,762 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-20 22:14:11,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-20 22:14:11,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,782 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-20 22:14:11,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2024-11-20 22:14:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,802 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-11-20 22:14:11,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-11-20 22:14:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,822 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-20 22:14:11,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-20 22:14:11,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,841 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-20 22:14:11,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-20 22:14:11,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,861 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-20 22:14:11,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-20 22:14:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,881 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-20 22:14:11,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,901 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-20 22:14:11,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-20 22:14:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,921 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-20 22:14:11,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-20 22:14:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,940 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-20 22:14:11,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-11-20 22:14:11,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,960 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-20 22:14:11,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,980 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:11,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-20 22:14:11,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:11,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:11,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:11,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:11,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:11,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:11,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:11,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:11,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:11,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:11,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:11,999 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-20 22:14:12,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:12,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:12,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:12,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,019 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-20 22:14:12,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:12,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:12,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:12,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-20 22:14:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,049 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-20 22:14:12,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:12,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:12,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:12,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-11-20 22:14:12,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,069 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-20 22:14:12,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:12,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:12,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:12,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,089 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-11-20 22:14:12,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:14:12,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:14:12,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:14:12,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-11-20 22:14:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,109 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-20 22:14:12,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:12,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-20 22:14:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,132 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-20 22:14:12,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:12,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-20 22:14:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,164 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-11-20 22:14:12,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:12,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,209 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-20 22:14:12,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,225 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-20 22:14:12,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,229 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-20 22:14:12,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,250 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-20 22:14:12,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:12,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:12,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,278 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-20 22:14:12,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:12,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:12,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:12,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:12,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:12,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:12,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:12,325 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:12,388 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2024-11-20 22:14:12,389 INFO L444 ModelExtractionUtils]: 5 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-11-20 22:14:12,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:12,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:12,391 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:12,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-20 22:14:12,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:12,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:14:12,410 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:12,410 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_6, ULTIMATE.start_memcmp_~d~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_6 - 1*ULTIMATE.start_memcmp_~d~0#1.offset Supporting invariants [] [2024-11-20 22:14:12,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:12,504 INFO L156 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2024-11-20 22:14:12,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~d~0!offset [2024-11-20 22:14:12,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:14:12,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:14:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 22:14:12,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:12,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:14:12,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:12,731 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-20 22:14:12,731 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 160 transitions. cyclomatic complexity: 39 Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,787 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 160 transitions. cyclomatic complexity: 39. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 208 transitions. Complement of second has 9 states. [2024-11-20 22:14:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:14:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2024-11-20 22:14:12,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 32 letters. Loop has 3 letters. [2024-11-20 22:14:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 35 letters. Loop has 3 letters. [2024-11-20 22:14:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 32 letters. Loop has 6 letters. [2024-11-20 22:14:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:12,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 208 transitions. [2024-11-20 22:14:12,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-20 22:14:12,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 158 states and 191 transitions. [2024-11-20 22:14:12,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2024-11-20 22:14:12,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-20 22:14:12,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 191 transitions. [2024-11-20 22:14:12,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:12,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 191 transitions. [2024-11-20 22:14:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 191 transitions. [2024-11-20 22:14:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2024-11-20 22:14:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.2171052631578947) internal successors, (185), 151 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2024-11-20 22:14:12,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-20 22:14:12,801 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-20 22:14:12,801 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-20 22:14:12,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2024-11-20 22:14:12,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-20 22:14:12,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:12,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:12,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 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] [2024-11-20 22:14:12,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:14:12,805 INFO L745 eck$LassoCheckResult]: Stem: 2892#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2849#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2850#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2837#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 2839#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2975#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 2842#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 2840#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2841#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2848#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2843#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 2844#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 2845#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2846#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2847#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2983#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2982#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 2981#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 2951#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2944#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 2946#L510-5 strlen_#res#1 := strlen_~i~0#1; 2942#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2940#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2927#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2868#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 2869#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 2920#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 2918#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 2917#L510-11 strlen_#res#1 := strlen_~i~0#1; 2916#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2914#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2851#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2852#L532-3 [2024-11-20 22:14:12,806 INFO L747 eck$LassoCheckResult]: Loop: 2852#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 2913#L533 assume !strstr_#t~short16#1; 2876#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 2877#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 2852#L532-3 [2024-11-20 22:14:12,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2104844943, now seen corresponding path program 2 times [2024-11-20 22:14:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778712672] [2024-11-20 22:14:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 5 times [2024-11-20 22:14:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021918035] [2024-11-20 22:14:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 671339115, now seen corresponding path program 2 times [2024-11-20 22:14:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87035957] [2024-11-20 22:14:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:12,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:13,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:14,648 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:14:14,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:14:14,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:14:14,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:14:14,648 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:14:14,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:14,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:14:14,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:14:14,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration13_Lasso [2024-11-20 22:14:14,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:14:14,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:14:14,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:14,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:14:15,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:14:15,540 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:14:15,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,544 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-11-20 22:14:15,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,556 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-20 22:14:15,556 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:14:15,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,568 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-20 22:14:15,568 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:14:15,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:15,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,595 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-20 22:14:15,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-11-20 22:14:15,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-11-20 22:14:15,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,619 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-20 22:14:15,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-11-20 22:14:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,645 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-20 22:14:15,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-11-20 22:14:15,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,670 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-20 22:14:15,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-11-20 22:14:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,691 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-20 22:14:15,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:14:15,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-20 22:14:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,716 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-20 22:14:15,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:14:15,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:14:15,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:14:15,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:14:15,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:14:15,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:14:15,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:14:15,737 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:14:15,749 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-20 22:14:15,749 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:14:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:14:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:15,750 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:14:15,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-20 22:14:15,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:14:15,763 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:14:15,763 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:14:15,763 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_3) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~haystack#1.base)_3 Supporting invariants [] [2024-11-20 22:14:15,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-11-20 22:14:15,794 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-11-20 22:14:15,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:14:15,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:14:15,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2024-11-20 22:14:15,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:15,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:14:15,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:15,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:14:15,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:14:15,910 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-11-20 22:14:15,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 49 Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:15,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 185 transitions. cyclomatic complexity: 49. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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) Result 193 states and 244 transitions. Complement of second has 6 states. [2024-11-20 22:14:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:14:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2024-11-20 22:14:15,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-20 22:14:15,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:15,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 36 letters. Loop has 4 letters. [2024-11-20 22:14:15,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:15,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 32 letters. Loop has 8 letters. [2024-11-20 22:14:15,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:14:15,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 244 transitions. [2024-11-20 22:14:15,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:14:15,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 158 states and 192 transitions. [2024-11-20 22:14:15,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-20 22:14:15,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-20 22:14:15,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 192 transitions. [2024-11-20 22:14:15,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:15,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 192 transitions. [2024-11-20 22:14:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 192 transitions. [2024-11-20 22:14:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2024-11-20 22:14:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-11-20 22:14:15,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-11-20 22:14:15,936 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-11-20 22:14:15,936 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-20 22:14:15,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 111 transitions. [2024-11-20 22:14:15,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:15,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:15,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:15,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:15,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:15,938 INFO L745 eck$LassoCheckResult]: Stem: 3420#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3385#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3373#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 3375#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3376#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3377#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 3383#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 3378#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 3379#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 3380#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3381#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3382#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3388#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3389#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 3402#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 3390#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3391#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 3416#L510-5 strlen_#res#1 := strlen_~i~0#1; 3423#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3430#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3394#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3395#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 3401#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 3396#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3397#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 3400#L510-11 strlen_#res#1 := strlen_~i~0#1; 3405#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 3393#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3386#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 3387#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 3415#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3409#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3424#L518-1 assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1; 3398#L518-4 memcmp_#res#1 := 0; 3399#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 3421#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 3431#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 3429#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 3414#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3407#L518-3 [2024-11-20 22:14:15,938 INFO L747 eck$LassoCheckResult]: Loop: 3407#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3417#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 3406#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 3407#L518-3 [2024-11-20 22:14:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash -840479618, now seen corresponding path program 1 times [2024-11-20 22:14:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736684730] [2024-11-20 22:14:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 22:14:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:16,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736684730] [2024-11-20 22:14:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736684730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:14:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792347883] [2024-11-20 22:14:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:16,045 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:16,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2024-11-20 22:14:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537831155] [2024-11-20 22:14:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:16,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:16,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 22:14:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 22:14:16,154 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:16,174 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2024-11-20 22:14:16,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 112 transitions. [2024-11-20 22:14:16,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:16,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 92 states and 108 transitions. [2024-11-20 22:14:16,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-20 22:14:16,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-20 22:14:16,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 108 transitions. [2024-11-20 22:14:16,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:16,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-20 22:14:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 108 transitions. [2024-11-20 22:14:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 22:14:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.173913043478261) internal successors, (108), 91 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2024-11-20 22:14:16,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-20 22:14:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 22:14:16,179 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-20 22:14:16,179 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-20 22:14:16,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 108 transitions. [2024-11-20 22:14:16,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:16,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:16,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:16,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:16,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:16,180 INFO L745 eck$LassoCheckResult]: Stem: 3611#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3580#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3568#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 3570#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 3571#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3572#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 3658#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 3657#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 3656#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 3655#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3653#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3651#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3649#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3647#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 3645#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 3644#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3609#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 3610#L510-5 strlen_#res#1 := strlen_~i~0#1; 3605#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3595#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3588#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3589#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 3593#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 3590#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 3591#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 3592#L510-11 strlen_#res#1 := strlen_~i~0#1; 3596#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 3587#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3581#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 3582#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 3626#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3600#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3615#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 3616#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 3614#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 3601#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 3602#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 3603#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 3606#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3598#L518-3 [2024-11-20 22:14:16,180 INFO L747 eck$LassoCheckResult]: Loop: 3598#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3612#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 3597#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 3598#L518-3 [2024-11-20 22:14:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash 762752838, now seen corresponding path program 1 times [2024-11-20 22:14:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:16,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54478596] [2024-11-20 22:14:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:16,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-20 22:14:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:14:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:16,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54478596] [2024-11-20 22:14:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54478596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808895743] [2024-11-20 22:14:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:16,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:16,462 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2024-11-20 22:14:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:16,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-20 22:14:16,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 22:14:16,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-20 22:14:16,691 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-20 22:14:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-11-20 22:14:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 22:14:16,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 22:14:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808895743] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 22:14:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 8] total 20 [2024-11-20 22:14:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120798974] [2024-11-20 22:14:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:16,764 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:16,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2024-11-20 22:14:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962484446] [2024-11-20 22:14:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:16,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:16,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:16,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:16,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:14:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2024-11-20 22:14:16,864 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:16,928 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-20 22:14:16,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 120 transitions. [2024-11-20 22:14:16,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:16,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 102 states and 118 transitions. [2024-11-20 22:14:16,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-20 22:14:16,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-20 22:14:16,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 118 transitions. [2024-11-20 22:14:16,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:16,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 118 transitions. [2024-11-20 22:14:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 118 transitions. [2024-11-20 22:14:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-20 22:14:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 95 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2024-11-20 22:14:16,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-11-20 22:14:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:14:16,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-11-20 22:14:16,931 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-20 22:14:16,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 112 transitions. [2024-11-20 22:14:16,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:16,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:16,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:16,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-20 22:14:16,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:16,933 INFO L745 eck$LassoCheckResult]: Stem: 4068#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4036#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4037#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4025#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 4027#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 4028#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4029#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4113#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4112#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 4110#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 4109#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4107#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4106#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4105#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4104#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4103#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4102#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4066#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 4067#L510-5 strlen_#res#1 := strlen_~i~0#1; 4061#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4052#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4045#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4046#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4050#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4047#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4048#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 4049#L510-11 strlen_#res#1 := strlen_~i~0#1; 4053#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4044#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4038#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4039#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 4072#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4114#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4119#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4120#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4118#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4117#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4076#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4071#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 4064#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 4111#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 4108#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 4062#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4055#L518-3 [2024-11-20 22:14:16,933 INFO L747 eck$LassoCheckResult]: Loop: 4055#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4069#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4054#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4055#L518-3 [2024-11-20 22:14:16,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash -649369423, now seen corresponding path program 1 times [2024-11-20 22:14:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099086906] [2024-11-20 22:14:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 22:14:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099086906] [2024-11-20 22:14:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099086906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375170232] [2024-11-20 22:14:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:17,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:17,150 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:17,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2024-11-20 22:14:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:17,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-20 22:14:17,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:14:17,414 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 22:14:17,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-20 22:14:17,545 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 22:14:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-20 22:14:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:14:17,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:18,294 INFO L349 Elim1Store]: treesize reduction 19, result has 45.7 percent of original size [2024-11-20 22:14:18,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2024-11-20 22:14:18,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc24#1.base_318| Int)) (let ((.cse0 (select (select (store |c_#memory_int#0| |v_ULTIMATE.start_main_#t~malloc24#1.base_318| v_arrayElimArr_1) |c_ULTIMATE.start_main_~hay~0#1.base|) (+ |c_ULTIMATE.start_main_~hay~0#1.offset| 1)))) (or (not (= (select v_arrayElimArr_1 0) .cse0)) (not (= (select v_arrayElimArr_1 1) 0)) (= .cse0 0)))) is different from false [2024-11-20 22:14:18,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:18,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2024-11-20 22:14:18,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:18,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 58 [2024-11-20 22:14:18,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:18,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2024-11-20 22:14:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 22:14:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375170232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:18,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 36 [2024-11-20 22:14:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068620610] [2024-11-20 22:14:18,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:18,550 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:18,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2024-11-20 22:14:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435664581] [2024-11-20 22:14:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:18,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:18,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-20 22:14:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2024-11-20 22:14:18,670 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. cyclomatic complexity: 26 Second operand has 36 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:19,943 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2024-11-20 22:14:19,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 276 transitions. [2024-11-20 22:14:19,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:19,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 178 states and 204 transitions. [2024-11-20 22:14:19,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2024-11-20 22:14:19,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2024-11-20 22:14:19,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 204 transitions. [2024-11-20 22:14:19,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:19,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-20 22:14:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 204 transitions. [2024-11-20 22:14:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-11-20 22:14:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2024-11-20 22:14:19,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 177 transitions. [2024-11-20 22:14:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-20 22:14:19,951 INFO L425 stractBuchiCegarLoop]: Abstraction has 153 states and 177 transitions. [2024-11-20 22:14:19,951 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-20 22:14:19,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 177 transitions. [2024-11-20 22:14:19,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:19,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:19,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:19,953 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 2, 2, 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-11-20 22:14:19,953 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:19,953 INFO L745 eck$LassoCheckResult]: Stem: 4766#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4731#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4715#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4716#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4867#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4866#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 4865#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 4864#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4863#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4748#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4732#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4733#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4861#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4734#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4735#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4745#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4746#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4858#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4856#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4854#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4849#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 4850#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 4848#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4841#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 4840#L510-5 strlen_#res#1 := strlen_~i~0#1; 4839#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4838#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4837#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 4741#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 4743#L510-11 strlen_#res#1 := strlen_~i~0#1; 4749#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4736#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4737#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4771#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 4772#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4797#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4795#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4796#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4794#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4793#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4777#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4778#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 4776#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 4774#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 4773#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 4759#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4751#L518-3 [2024-11-20 22:14:19,953 INFO L747 eck$LassoCheckResult]: Loop: 4751#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4763#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 4750#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4751#L518-3 [2024-11-20 22:14:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1758913841, now seen corresponding path program 1 times [2024-11-20 22:14:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654490512] [2024-11-20 22:14:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 22:14:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654490512] [2024-11-20 22:14:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654490512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604293978] [2024-11-20 22:14:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:20,244 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2024-11-20 22:14:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:20,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 22:14:20,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 22:14:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 22:14:20,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:20,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-20 22:14:20,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-20 22:14:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 22:14:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604293978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:20,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:20,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-20 22:14:20,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888853739] [2024-11-20 22:14:20,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:20,547 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:20,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2024-11-20 22:14:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714602558] [2024-11-20 22:14:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:20,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:20,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 22:14:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-20 22:14:20,660 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. cyclomatic complexity: 37 Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:20,942 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2024-11-20 22:14:20,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 157 transitions. [2024-11-20 22:14:20,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:20,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 120 states and 136 transitions. [2024-11-20 22:14:20,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-20 22:14:20,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-20 22:14:20,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 136 transitions. [2024-11-20 22:14:20,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:20,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-20 22:14:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 136 transitions. [2024-11-20 22:14:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2024-11-20 22:14:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-20 22:14:20,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-20 22:14:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 22:14:20,947 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-20 22:14:20,947 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-20 22:14:20,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 122 transitions. [2024-11-20 22:14:20,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:20,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:20,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:20,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2024-11-20 22:14:20,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:20,948 INFO L745 eck$LassoCheckResult]: Stem: 5372#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 5340#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 5327#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 5329#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 5330#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5331#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 5338#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 5332#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 5333#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 5368#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 5427#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 5426#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5417#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5416#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5415#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 5371#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 5355#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 5345#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 5346#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 5411#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 5409#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 5369#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 5370#L510-5 strlen_#res#1 := strlen_~i~0#1; 5365#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5356#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5348#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 5349#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 5354#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 5350#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 5351#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 5429#L510-11 strlen_#res#1 := strlen_~i~0#1; 5428#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 5420#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5419#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 5418#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 5378#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5374#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5375#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 5360#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5361#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5383#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 5379#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5376#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 5377#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 5381#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 5380#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 5366#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5359#L518-3 [2024-11-20 22:14:20,948 INFO L747 eck$LassoCheckResult]: Loop: 5359#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5373#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 5358#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5359#L518-3 [2024-11-20 22:14:20,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash 914730776, now seen corresponding path program 2 times [2024-11-20 22:14:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108956366] [2024-11-20 22:14:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 22:14:21,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:21,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108956366] [2024-11-20 22:14:21,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108956366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:21,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697914891] [2024-11-20 22:14:21,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:14:21,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:21,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:21,201 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:21,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2024-11-20 22:14:21,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:14:21,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:14:21,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-20 22:14:21,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:21,791 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-20 22:14:21,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 33 [2024-11-20 22:14:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 22:14:21,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:22,234 INFO L349 Elim1Store]: treesize reduction 39, result has 59.8 percent of original size [2024-11-20 22:14:22,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 73 [2024-11-20 22:14:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 22:14:22,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697914891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:22,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:22,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 34 [2024-11-20 22:14:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001392085] [2024-11-20 22:14:22,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:22,280 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2024-11-20 22:14:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:22,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494328446] [2024-11-20 22:14:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:22,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:22,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 22:14:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 22:14:22,376 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. cyclomatic complexity: 25 Second operand has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:23,346 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2024-11-20 22:14:23,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 246 transitions. [2024-11-20 22:14:23,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:14:23,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 209 states and 239 transitions. [2024-11-20 22:14:23,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-20 22:14:23,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-20 22:14:23,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 239 transitions. [2024-11-20 22:14:23,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:23,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 239 transitions. [2024-11-20 22:14:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 239 transitions. [2024-11-20 22:14:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 136. [2024-11-20 22:14:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 135 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2024-11-20 22:14:23,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-11-20 22:14:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-20 22:14:23,355 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-11-20 22:14:23,355 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-20 22:14:23,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 154 transitions. [2024-11-20 22:14:23,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:23,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:23,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:23,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:14:23,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:23,356 INFO L745 eck$LassoCheckResult]: Stem: 6082#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6043#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 6044#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 6031#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 6033#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 6034#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6035#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 6042#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 6036#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 6037#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 6038#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 6039#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 6091#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6040#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6041#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6047#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6048#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 6104#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 6105#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6135#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 6134#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 6131#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6129#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 6127#L510-5 strlen_#res#1 := strlen_~i~0#1; 6073#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6060#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6061#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6119#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 6118#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 6054#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6055#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 6058#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 6077#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6056#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 6057#L510-11 strlen_#res#1 := strlen_~i~0#1; 6064#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 6051#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6045#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 6046#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 6087#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6084#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6085#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 6067#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6068#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6155#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 6100#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6086#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 6076#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 6093#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 6092#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 6074#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6066#L518-3 [2024-11-20 22:14:23,357 INFO L747 eck$LassoCheckResult]: Loop: 6066#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6083#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 6065#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6066#L518-3 [2024-11-20 22:14:23,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1771858513, now seen corresponding path program 3 times [2024-11-20 22:14:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111129912] [2024-11-20 22:14:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:14:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:23,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111129912] [2024-11-20 22:14:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111129912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049517138] [2024-11-20 22:14:23,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:14:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:23,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:23,678 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:23,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2024-11-20 22:14:23,843 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 22:14:23,843 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:14:23,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-20 22:14:23,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:23,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 22:14:23,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 22:14:23,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 22:14:23,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 22:14:23,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:23,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:24,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 22:14:24,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:25,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strlen_~s#1.offset_114| Int) (|v_ULTIMATE.start_strlen_~s#1.offset_115| Int) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~needle~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~hay~0#1.base|)) (.cse1 (select v_ArrVal_440 |c_ULTIMATE.start_main_~needle~0#1.offset|))) (or (< |v_ULTIMATE.start_strlen_~s#1.offset_115| 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~hay~0#1.offset|) .cse1)) (not (= (select .cse0 |v_ULTIMATE.start_strlen_~s#1.offset_114|) 0)) (< |c_ULTIMATE.start_main_~needle~0#1.offset| |v_ULTIMATE.start_strlen_~s#1.offset_115|) (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~hay~0#1.offset| 1)) .cse1)) (= (select v_ArrVal_440 |v_ULTIMATE.start_strlen_~s#1.offset_115|) 0)))) is different from false [2024-11-20 22:14:25,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:25,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 51 [2024-11-20 22:14:25,286 INFO L349 Elim1Store]: treesize reduction 10, result has 78.7 percent of original size [2024-11-20 22:14:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 111 [2024-11-20 22:14:25,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 84 [2024-11-20 22:14:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 22:14:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049517138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:25,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 44 [2024-11-20 22:14:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286178169] [2024-11-20 22:14:25,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:25,618 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2024-11-20 22:14:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701734802] [2024-11-20 22:14:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:25,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:25,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-20 22:14:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1632, Unknown=3, NotChecked=82, Total=1892 [2024-11-20 22:14:25,735 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. cyclomatic complexity: 29 Second operand has 44 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 44 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:25,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~hay~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_strlen_~s#1.offset_114| Int) (|v_ULTIMATE.start_main_#t~malloc24#1.base_320| Int) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (select v_ArrVal_440 0)) (.cse1 (select (store |c_#memory_int#0| |v_ULTIMATE.start_main_#t~malloc24#1.base_320| v_ArrVal_440) |c_ULTIMATE.start_main_~hay~0#1.base|))) (or (= .cse0 0) (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~hay~0#1.offset|))) (not (= .cse0 (select .cse1 .cse2))) (not (= (select .cse1 |v_ULTIMATE.start_strlen_~s#1.offset_114|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc24#1.base_320|) 0))))) (forall ((|v_ULTIMATE.start_strlen_~s#1.offset_114| Int) (|v_ULTIMATE.start_strlen_~s#1.offset_115| Int) (v_ArrVal_440 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~needle~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~hay~0#1.base|)) (.cse4 (select v_ArrVal_440 |c_ULTIMATE.start_main_~needle~0#1.offset|))) (or (< |v_ULTIMATE.start_strlen_~s#1.offset_115| 0) (not (= (select .cse3 |c_ULTIMATE.start_main_~hay~0#1.offset|) .cse4)) (not (= (select .cse3 |v_ULTIMATE.start_strlen_~s#1.offset_114|) 0)) (< |c_ULTIMATE.start_main_~needle~0#1.offset| |v_ULTIMATE.start_strlen_~s#1.offset_115|) (not (= (select .cse3 .cse2) .cse4)) (= (select v_ArrVal_440 |v_ULTIMATE.start_strlen_~s#1.offset_115|) 0)))))) is different from false [2024-11-20 22:14:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:28,506 INFO L93 Difference]: Finished difference Result 374 states and 417 transitions. [2024-11-20 22:14:28,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 417 transitions. [2024-11-20 22:14:28,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:14:28,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 328 states and 369 transitions. [2024-11-20 22:14:28,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2024-11-20 22:14:28,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2024-11-20 22:14:28,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 369 transitions. [2024-11-20 22:14:28,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:28,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 328 states and 369 transitions. [2024-11-20 22:14:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 369 transitions. [2024-11-20 22:14:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 204. [2024-11-20 22:14:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.1274509803921569) internal successors, (230), 203 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2024-11-20 22:14:28,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 230 transitions. [2024-11-20 22:14:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-20 22:14:28,518 INFO L425 stractBuchiCegarLoop]: Abstraction has 204 states and 230 transitions. [2024-11-20 22:14:28,518 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-20 22:14:28,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 230 transitions. [2024-11-20 22:14:28,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:28,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:28,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:28,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 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] [2024-11-20 22:14:28,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:28,522 INFO L745 eck$LassoCheckResult]: Stem: 7065#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7032#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 7016#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7017#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 7028#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 7022#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 7023#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7024#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 7025#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7171#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7167#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7164#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7159#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7156#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7154#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7152#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7150#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7148#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7146#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7144#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7142#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7139#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7133#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7136#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7132#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7130#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7128#L510-5 strlen_#res#1 := strlen_~i~0#1; 7126#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7124#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7117#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7116#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7115#L510-11 strlen_#res#1 := strlen_~i~0#1; 7114#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 7113#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7112#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 7111#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7069#L533 assume !strstr_#t~short16#1; 7095#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 7099#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 7097#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7094#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7092#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7085#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7089#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7084#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7086#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7081#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7080#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 7075#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 7073#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 7072#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7056#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7048#L518-3 [2024-11-20 22:14:28,522 INFO L747 eck$LassoCheckResult]: Loop: 7048#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7062#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7047#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7048#L518-3 [2024-11-20 22:14:28,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1242070257, now seen corresponding path program 1 times [2024-11-20 22:14:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:28,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656917013] [2024-11-20 22:14:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-20 22:14:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656917013] [2024-11-20 22:14:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656917013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:14:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:14:28,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 22:14:28,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792114129] [2024-11-20 22:14:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:14:28,675 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2024-11-20 22:14:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233873498] [2024-11-20 22:14:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:28,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:28,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:14:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:14:28,784 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. cyclomatic complexity: 40 Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:28,803 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2024-11-20 22:14:28,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 226 transitions. [2024-11-20 22:14:28,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:28,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 165 states and 186 transitions. [2024-11-20 22:14:28,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-11-20 22:14:28,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-20 22:14:28,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 186 transitions. [2024-11-20 22:14:28,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:28,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165 states and 186 transitions. [2024-11-20 22:14:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 186 transitions. [2024-11-20 22:14:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2024-11-20 22:14:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.1283783783783783) internal successors, (167), 147 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-20 22:14:28,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-20 22:14:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:14:28,808 INFO L425 stractBuchiCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-20 22:14:28,808 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-20 22:14:28,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 167 transitions. [2024-11-20 22:14:28,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:28,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:28,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:28,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-11-20 22:14:28,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:28,810 INFO L745 eck$LassoCheckResult]: Stem: 7482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7444#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 7431#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 7432#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 7574#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7573#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 7572#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 7570#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 7568#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7566#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 7563#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7562#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7440#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7441#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7447#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7448#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7571#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7569#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7567#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7565#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7564#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7451#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7578#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7449#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7450#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7477#L510-5 strlen_#res#1 := strlen_~i~0#1; 7473#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7462#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7453#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7454#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 7529#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 7527#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7524#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7522#L510-11 strlen_#res#1 := strlen_~i~0#1; 7520#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 7510#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7507#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 7504#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7501#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7500#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7498#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7499#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7497#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7496#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7494#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7483#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 7484#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 7505#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 7502#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7492#L533 assume !strstr_#t~short16#1; 7491#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 7489#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 7488#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 7474#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7467#L518-3 [2024-11-20 22:14:28,810 INFO L747 eck$LassoCheckResult]: Loop: 7467#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7479#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 7466#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7467#L518-3 [2024-11-20 22:14:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1146910187, now seen corresponding path program 1 times [2024-11-20 22:14:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302545492] [2024-11-20 22:14:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 22:14:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302545492] [2024-11-20 22:14:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302545492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838365509] [2024-11-20 22:14:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:29,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:29,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:29,093 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:29,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2024-11-20 22:14:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:29,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-20 22:14:29,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:29,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 22:14:29,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 22:14:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 22:14:29,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:29,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-20 22:14:29,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-20 22:14:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-20 22:14:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838365509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:29,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-20 22:14:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545525617] [2024-11-20 22:14:29,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:29,632 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2024-11-20 22:14:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421672146] [2024-11-20 22:14:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:29,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:29,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 22:14:29,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2024-11-20 22:14:29,745 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. cyclomatic complexity: 31 Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:30,273 INFO L93 Difference]: Finished difference Result 327 states and 368 transitions. [2024-11-20 22:14:30,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 368 transitions. [2024-11-20 22:14:30,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:14:30,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 315 states and 356 transitions. [2024-11-20 22:14:30,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2024-11-20 22:14:30,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2024-11-20 22:14:30,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 356 transitions. [2024-11-20 22:14:30,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:30,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 356 transitions. [2024-11-20 22:14:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 356 transitions. [2024-11-20 22:14:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 186. [2024-11-20 22:14:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.1236559139784945) internal successors, (209), 185 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2024-11-20 22:14:30,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 209 transitions. [2024-11-20 22:14:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-20 22:14:30,282 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 209 transitions. [2024-11-20 22:14:30,282 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-20 22:14:30,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 209 transitions. [2024-11-20 22:14:30,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:30,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:30,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:30,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 22:14:30,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:30,283 INFO L745 eck$LassoCheckResult]: Stem: 8338#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8298#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 8281#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 8282#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 8283#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 8285#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 8286#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 8293#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 8294#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 8287#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 8288#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 8289#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 8290#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 8388#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8389#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 8375#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8376#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8352#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 8353#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 8369#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8370#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 8310#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 8311#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8422#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8448#L510-5 strlen_#res#1 := strlen_~i~0#1; 8447#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 8446#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8445#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8443#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 8441#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 8439#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8437#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 8436#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 8435#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8406#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 8432#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 8431#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8430#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8397#L510-11 strlen_#res#1 := strlen_~i~0#1; 8339#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 8303#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8295#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 8296#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 8342#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 8396#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8393#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 8395#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 8392#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8394#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 8355#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8351#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 8349#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 8347#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 8346#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 8328#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 8320#L518-3 [2024-11-20 22:14:30,284 INFO L747 eck$LassoCheckResult]: Loop: 8320#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8335#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 8319#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 8320#L518-3 [2024-11-20 22:14:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1303219306, now seen corresponding path program 4 times [2024-11-20 22:14:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120363435] [2024-11-20 22:14:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-20 22:14:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:31,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120363435] [2024-11-20 22:14:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120363435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519055624] [2024-11-20 22:14:31,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:14:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:31,018 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2024-11-20 22:14:31,231 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:14:31,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:14:31,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-20 22:14:31,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:31,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:14:31,394 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 22:14:31,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-20 22:14:31,442 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 22:14:31,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-20 22:14:31,479 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 22:14:31,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-20 22:14:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 22:14:31,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:32,102 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~needle~0#1.base| Int) (v_ArrVal_518 (Array Int Int))) (or (= (select (select (store |c_#memory_int#0| |ULTIMATE.start_main_~needle~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~hay~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~hay~0#1.offset|)) 0) (not (= (select v_ArrVal_518 (+ 2 |c_ULTIMATE.start_main_~needle~0#1.offset|)) 0)))) is different from false [2024-11-20 22:14:32,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-20 22:14:32,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:32,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2024-11-20 22:14:32,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-20 22:14:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2024-11-20 22:14:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519055624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:32,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 19] total 42 [2024-11-20 22:14:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846086059] [2024-11-20 22:14:32,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:32,307 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 10 times [2024-11-20 22:14:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527789464] [2024-11-20 22:14:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:32,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:32,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:32,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-20 22:14:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1494, Unknown=17, NotChecked=78, Total=1722 [2024-11-20 22:14:32,429 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. cyclomatic complexity: 35 Second operand has 42 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 42 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:33,322 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2024-11-20 22:14:33,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 379 transitions. [2024-11-20 22:14:33,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:33,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 317 states and 356 transitions. [2024-11-20 22:14:33,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-20 22:14:33,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2024-11-20 22:14:33,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 356 transitions. [2024-11-20 22:14:33,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:33,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 317 states and 356 transitions. [2024-11-20 22:14:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 356 transitions. [2024-11-20 22:14:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 231. [2024-11-20 22:14:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.121212121212121) internal successors, (259), 230 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2024-11-20 22:14:33,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 231 states and 259 transitions. [2024-11-20 22:14:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 22:14:33,332 INFO L425 stractBuchiCegarLoop]: Abstraction has 231 states and 259 transitions. [2024-11-20 22:14:33,332 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-20 22:14:33,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 259 transitions. [2024-11-20 22:14:33,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:33,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:33,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:33,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 22:14:33,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:33,333 INFO L745 eck$LassoCheckResult]: Stem: 9275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 9233#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 9217#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 9218#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 9222#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 9230#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 9231#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 9223#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 9224#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 9370#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 9371#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 9366#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 9367#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 9254#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9255#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9360#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 9361#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 9310#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9311#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 9357#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 9358#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9273#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 9274#L510-5 strlen_#res#1 := strlen_~i~0#1; 9265#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 9252#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9253#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9436#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 9434#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 9432#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9430#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 9272#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 9244#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9243#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 9247#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 9427#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9388#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 9386#L510-11 strlen_#res#1 := strlen_~i~0#1; 9383#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 9382#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 9234#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 9235#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 9281#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 9308#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9306#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 9307#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 9305#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9304#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 9301#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 9279#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 9280#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 9293#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 9294#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 9290#L533 assume !strstr_#t~short16#1; 9289#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 9287#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 9286#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 9266#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 9258#L518-3 [2024-11-20 22:14:33,334 INFO L747 eck$LassoCheckResult]: Loop: 9258#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9276#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 9257#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 9258#L518-3 [2024-11-20 22:14:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -44303980, now seen corresponding path program 2 times [2024-11-20 22:14:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416531316] [2024-11-20 22:14:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:14:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416531316] [2024-11-20 22:14:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416531316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74202212] [2024-11-20 22:14:33,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:14:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:33,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:33,667 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:33,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2024-11-20 22:14:33,865 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:14:33,866 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:14:33,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 22:14:33,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:33,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 22:14:33,975 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 22:14:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 22:14:34,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:34,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:34,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-20 22:14:34,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 22:14:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:14:34,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:34,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 (Array Int Int))) (= (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~needle~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_main_~hay~0#1.base|) (+ |c_ULTIMATE.start_main_~hay~0#1.offset| 1)) 0)) is different from false [2024-11-20 22:14:34,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:14:34,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-20 22:14:34,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 22:14:34,317 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 22:14:34,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2024-11-20 22:14:34,323 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 22:14:34,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-20 22:14:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-20 22:14:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74202212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:34,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2024-11-20 22:14:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939586227] [2024-11-20 22:14:34,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:34,391 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:34,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 11 times [2024-11-20 22:14:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240011401] [2024-11-20 22:14:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:34,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:34,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 22:14:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=857, Unknown=1, NotChecked=58, Total=992 [2024-11-20 22:14:34,504 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. cyclomatic complexity: 42 Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:14:35,361 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2024-11-20 22:14:35,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 377 transitions. [2024-11-20 22:14:35,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-11-20 22:14:35,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 284 states and 318 transitions. [2024-11-20 22:14:35,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2024-11-20 22:14:35,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-20 22:14:35,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 318 transitions. [2024-11-20 22:14:35,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:14:35,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 284 states and 318 transitions. [2024-11-20 22:14:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 318 transitions. [2024-11-20 22:14:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 228. [2024-11-20 22:14:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 228 states have (on average 1.1140350877192982) internal successors, (254), 227 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:14:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 254 transitions. [2024-11-20 22:14:35,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 228 states and 254 transitions. [2024-11-20 22:14:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-20 22:14:35,368 INFO L425 stractBuchiCegarLoop]: Abstraction has 228 states and 254 transitions. [2024-11-20 22:14:35,368 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-20 22:14:35,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states and 254 transitions. [2024-11-20 22:14:35,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-20 22:14:35,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:14:35,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:14:35,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-20 22:14:35,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:14:35,369 INFO L745 eck$LassoCheckResult]: Stem: 10267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet21#1, main_#t~post22#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet25#1, main_#t~post26#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;havoc main_#t~nondet19#1;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 10221#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 10206#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 10207#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 10208#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet21#1;call write~int#0(main_#t~nondet21#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet21#1; 10210#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 10211#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 10218#L544-4 havoc main_~i~2#1;call write~int#0(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet23#1;main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 10219#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 10212#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 10213#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 10214#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 10215#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 10337#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);havoc main_#t~nondet25#1;call write~int#0(main_#t~nondet25#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet25#1; 10334#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 10332#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 10333#L552-4 havoc main_~i~3#1;call write~int#0(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem13#1, strstr_#t~mem14#1, strstr_#t~ret15#1, strstr_#t~short16#1, strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset, strstr_#t~pre18#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 10241#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 10242#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10412#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 10411#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 10410#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10409#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 10408#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 10407#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10406#L510-1 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 10405#L510-3 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 10403#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10404#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 10416#L510-5 strlen_#res#1 := strlen_~i~0#1; 10396#strlen_returnLabel#1 strstr_#t~ret11#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 10397#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 10392#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10387#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 10388#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 10413#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10393#L510-7 assume !!(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1; 10261#L510-9 strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset; 10262#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10233#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 10234#L510-11 strlen_#res#1 := strlen_~i~0#1; 10243#strlen_returnLabel#2 strstr_#t~ret12#1 := strlen_#res#1;havoc strlen_#t~mem2#1, strlen_#t~pre3#1, strlen_#t~pre4#1.base, strlen_#t~pre4#1.offset, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;havoc strlen_#in~s#1.base, strlen_#in~s#1.offset;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 10228#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 10222#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 10223#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 10273#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 10269#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10270#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 10246#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 10247#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10427#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 10347#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 10344#memcmp_returnLabel#1 strstr_#t~ret15#1 := memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;havoc memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1;assume { :end_inline_memcmp } true;strstr_#t~short16#1 := 0 == strstr_#t~ret15#1; 10342#L533-2 assume !strstr_#t~short16#1;havoc strstr_#t~mem13#1;havoc strstr_#t~mem14#1;havoc strstr_#t~ret15#1;havoc strstr_#t~short16#1;strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre17#1.base, strstr_#t~pre17#1.offset; 10340#L532-2 strstr_#t~pre18#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre18#1; 10252#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem13#1 := read~int#0(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem14#1 := read~int#0(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short16#1 := strstr_#t~mem13#1 == strstr_#t~mem14#1; 10256#L533 assume strstr_#t~short16#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~pre6#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 10245#L518-3 [2024-11-20 22:14:35,369 INFO L747 eck$LassoCheckResult]: Loop: 10245#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10268#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int#0(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int#0(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := (if memcmp_#t~mem7#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem7#1 % 256 % 4294967296 else memcmp_#t~mem7#1 % 256 % 4294967296 - 4294967296) - (if memcmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then memcmp_#t~mem8#1 % 256 % 4294967296 else memcmp_#t~mem8#1 % 256 % 4294967296 - 4294967296); 10244#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 10245#L518-3 [2024-11-20 22:14:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2019938312, now seen corresponding path program 5 times [2024-11-20 22:14:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594752560] [2024-11-20 22:14:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:14:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-20 22:14:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:14:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594752560] [2024-11-20 22:14:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594752560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:14:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57348510] [2024-11-20 22:14:35,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 22:14:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:14:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:14:35,671 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:14:35,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2024-11-20 22:14:35,880 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-20 22:14:35,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:14:35,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-20 22:14:35,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:14:35,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-20 22:14:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 22:14:36,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:14:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-20 22:14:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57348510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:14:36,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:14:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 13] total 48 [2024-11-20 22:14:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210927342] [2024-11-20 22:14:36,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:14:36,818 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:14:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:14:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 12 times [2024-11-20 22:14:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:14:36,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301206856] [2024-11-20 22:14:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:14:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:14:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:36,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:14:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:14:36,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:14:36,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:14:36,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-20 22:14:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2061, Unknown=0, NotChecked=0, Total=2256 [2024-11-20 22:14:36,937 INFO L87 Difference]: Start difference. First operand 228 states and 254 transitions. cyclomatic complexity: 40 Second operand has 48 states, 48 states have (on average 2.4791666666666665) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:15:01,305 WARN L286 SmtUtils]: Spent 24.02s on a formula simplification. DAG size of input: 20 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)