./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f 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 ../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-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:09:39,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:09:40,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 02:09:40,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:09:40,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:09:40,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:09:40,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:09:40,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:09:40,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:09:40,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:09:40,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:09:40,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:09:40,057 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:09:40,058 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:09:40,058 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:09:40,059 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:09:40,059 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:09:40,059 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:09:40,059 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:09:40,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:09:40,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:09:40,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:09:40,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:09:40,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:09:40,064 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:09:40,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:09:40,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:09:40,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:09:40,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:09:40,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:09:40,064 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:09:40,065 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-23 02:09:40,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:09:40,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:09:40,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:09:40,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:09:40,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:09:40,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2024-11-23 02:09:41,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:09:41,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:09:41,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2024-11-23 02:09:41,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b567b55df/3cdf0f10264d4d019670983c14f36fa9/FLAGb9cd5afea [2024-11-23 02:09:41,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b567b55df/3cdf0f10264d4d019670983c14f36fa9 [2024-11-23 02:09:41,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:09:41,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:09:41,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:09:41,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:09:41,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:09:41,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:09:41" (1/1) ... [2024-11-23 02:09:41,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37dabbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:41, skipping insertion in model container [2024-11-23 02:09:41,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:09:41" (1/1) ... [2024-11-23 02:09:41,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:09:41,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:09:41,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:09:42,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:09:42,025 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:09:42,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42 WrapperNode [2024-11-23 02:09:42,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:09:42,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:09:42,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:09:42,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:09:42,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,060 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 181 [2024-11-23 02:09:42,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:09:42,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:09:42,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:09:42,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:09:42,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,088 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-23 02:09:42,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:09:42,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:09:42,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:09:42,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:09:42,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (1/1) ... [2024-11-23 02:09:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:42,128 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-23 02:09:42,129 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-23 02:09:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:09:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:09:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:09:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:09:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:09:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:09:42,231 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:09:42,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:09:42,443 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-23 02:09:42,443 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:09:42,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:09:42,454 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-23 02:09:42,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:09:42 BoogieIcfgContainer [2024-11-23 02:09:42,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:09:42,455 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:09:42,456 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:09:42,458 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:09:42,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:09:42,459 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:09:41" (1/3) ... [2024-11-23 02:09:42,460 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f027dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:09:42, skipping insertion in model container [2024-11-23 02:09:42,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:09:42,461 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:09:42" (2/3) ... [2024-11-23 02:09:42,462 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f027dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:09:42, skipping insertion in model container [2024-11-23 02:09:42,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:09:42,462 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:09:42" (3/3) ... [2024-11-23 02:09:42,463 INFO L332 chiAutomizerObserver]: Analyzing ICFG strstr.i [2024-11-23 02:09:42,499 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:09:42,499 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:09:42,500 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:09:42,500 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:09:42,500 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:09:42,500 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:09:42,500 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:09:42,500 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:09:42,503 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-23 02:09:42,516 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2024-11-23 02:09:42,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:42,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:42,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:09:42,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:09:42,521 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:09:42,521 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-23 02:09:42,523 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2024-11-23 02:09:42,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:42,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:42,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:09:42,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:09:42,529 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-23 02:09:42,529 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-23 02:09:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-23 02:09:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113789603] [2024-11-23 02:09:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:42,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-23 02:09:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780794491] [2024-11-23 02:09:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-23 02:09:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261079913] [2024-11-23 02:09:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:42,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:43,025 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:43,026 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:43,026 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:43,026 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:43,026 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:43,026 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:43,027 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:43,027 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2024-11-23 02:09:43,027 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:43,027 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:43,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:43,388 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:43,392 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:43,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,395 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-23 02:09:43,396 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-23 02:09:43,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:43,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:43,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:43,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-23 02:09:43,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,432 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-23 02:09:43,433 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-23 02:09:43,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:43,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:43,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:43,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-23 02:09:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,460 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-23 02:09:43,462 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-23 02:09:43,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:43,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:43,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:43,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,487 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-23 02:09:43,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,489 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-23 02:09:43,491 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-23 02:09:43,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:43,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:43,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:43,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,515 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-23 02:09:43,516 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-23 02:09:43,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:43,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:43,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:43,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,538 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-23 02:09:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,540 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-23 02:09:43,542 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-23 02:09:43,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:43,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:43,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,566 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-23 02:09:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,568 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-23 02:09:43,569 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-23 02:09:43,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:43,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:43,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-23 02:09:43,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,598 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-23 02:09:43,599 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-23 02:09:43,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:43,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:43,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:43,627 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-23 02:09:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,630 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-23 02:09:43,631 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-23 02:09:43,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:43,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:43,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:43,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:43,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:43,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:43,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:43,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:43,681 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-23 02:09:43,681 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-23 02:09:43,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:43,715 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-23 02:09:43,716 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-23 02:09:43,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:43,728 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-23 02:09:43,728 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:43,729 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-23 02:09:43,735 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-23 02:09:43,746 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-11-23 02:09:43,755 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:09:43,756 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:09:43,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:43,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:09:43,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:43,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:09:43,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:43,822 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-23 02:09:43,848 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-23 02:09:43,850 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-23 02:09:43,907 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-23 02:09:43,909 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-23 02:09:43,914 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-23 02:09:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-11-23 02:09:43,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-23 02:09:43,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:43,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-23 02:09:43,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:43,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-23 02:09:43,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:43,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 117 transitions. [2024-11-23 02:09:43,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-23 02:09:43,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 34 states and 48 transitions. [2024-11-23 02:09:43,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-23 02:09:43,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-23 02:09:43,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2024-11-23 02:09:43,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:09:43,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:09:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2024-11-23 02:09:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-23 02:09:43,943 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-23 02:09:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-23 02:09:43,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:09:43,944 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:09:43,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:09:43,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2024-11-23 02:09:43,945 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-23 02:09:43,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:43,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:43,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:09:43,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:09:43,945 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-23 02:09:43,946 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-23 02:09:43,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2024-11-23 02:09:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530138475] [2024-11-23 02:09:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:43,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:43,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2024-11-23 02:09:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270397071] [2024-11-23 02:09:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:43,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:43,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:43,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2024-11-23 02:09:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636660659] [2024-11-23 02:09:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:44,010 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-23 02:09:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:44,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:44,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:44,284 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:44,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:44,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:44,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:44,285 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:44,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:44,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:44,285 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2024-11-23 02:09:44,285 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:44,285 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:44,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:44,656 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:44,656 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,660 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-23 02:09:44,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:44,664 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-23 02:09:44,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:44,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:44,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:44,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-23 02:09:44,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,684 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-23 02:09:44,685 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-23 02:09:44,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:44,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:44,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:44,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:44,710 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-23 02:09:44,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,713 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-23 02:09:44,714 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-23 02:09:44,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-23 02:09:44,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:44,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:44,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:44,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:44,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-23 02:09:44,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,736 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-23 02:09:44,737 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-23 02:09:44,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:44,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:44,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:44,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:44,758 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-23 02:09:44,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,760 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-23 02:09:44,763 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-23 02:09:44,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-23 02:09:44,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:44,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:44,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:44,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:09:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,792 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-23 02:09:44,793 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-23 02:09:44,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:44,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:44,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:44,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:44,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:44,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:44,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:44,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:44,858 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-11-23 02:09:44,858 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-23 02:09:44,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:44,860 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-23 02:09:44,861 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-23 02:09:44,863 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:44,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:09:44,874 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:44,875 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-23 02:09:44,881 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-23 02:09:44,898 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-11-23 02:09:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:44,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:09:44,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:44,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:09:44,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:09:44,947 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-23 02:09:44,948 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-23 02:09:44,967 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-23 02:09:44,968 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-23 02:09:44,968 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-23 02:09:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-11-23 02:09:44,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-23 02:09:44,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:44,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-23 02:09:44,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:44,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-23 02:09:44,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:44,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2024-11-23 02:09:44,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:44,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 35 states and 49 transitions. [2024-11-23 02:09:44,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-23 02:09:44,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-23 02:09:44,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2024-11-23 02:09:44,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:09:44,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-23 02:09:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2024-11-23 02:09:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-23 02:09:44,980 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-23 02:09:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2024-11-23 02:09:44,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-23 02:09:44,980 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2024-11-23 02:09:44,980 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:09:44,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 49 transitions. [2024-11-23 02:09:44,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:44,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:44,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:44,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:09:44,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:44,982 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-23 02:09:44,982 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-23 02:09:44,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2024-11-23 02:09:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734100159] [2024-11-23 02:09:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2024-11-23 02:09:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581565406] [2024-11-23 02:09:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2024-11-23 02:09:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506597829] [2024-11-23 02:09:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:45,286 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-23 02:09:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506597829] [2024-11-23 02:09:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506597829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:09:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:09:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:09:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309035529] [2024-11-23 02:09:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:09:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:09:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:09:45,328 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-23 02:09:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:45,382 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-23 02:09:45,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-23 02:09:45,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:45,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-23 02:09:45,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-23 02:09:45,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-23 02:09:45,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-23 02:09:45,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:09:45,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-23 02:09:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-23 02:09:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-23 02:09:45,385 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-23 02:09:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-23 02:09:45,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-23 02:09:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:09:45,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-23 02:09:45,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:09:45,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-11-23 02:09:45,387 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:45,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:45,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:45,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:09:45,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:45,387 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-23 02:09:45,388 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-23 02:09:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2024-11-23 02:09:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620353778] [2024-11-23 02:09:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:45,435 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-23 02:09:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620353778] [2024-11-23 02:09:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620353778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:09:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:09:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:09:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134521132] [2024-11-23 02:09:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:09:45,436 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:09:45,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2024-11-23 02:09:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261860564] [2024-11-23 02:09:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:09:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:09:45,486 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-23 02:09:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:45,511 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-23 02:09:45,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2024-11-23 02:09:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:45,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2024-11-23 02:09:45,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-23 02:09:45,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-23 02:09:45,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2024-11-23 02:09:45,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:09:45,513 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-23 02:09:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2024-11-23 02:09:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-23 02:09:45,514 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-23 02:09:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-23 02:09:45,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-23 02:09:45,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:09:45,517 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-23 02:09:45,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:09:45,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2024-11-23 02:09:45,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:45,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:45,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:45,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:09:45,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:45,519 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-23 02:09:45,519 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-23 02:09:45,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2024-11-23 02:09:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707785991] [2024-11-23 02:09:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2024-11-23 02:09:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623886407] [2024-11-23 02:09:45,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:09:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:09:45,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:45,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2024-11-23 02:09:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244236758] [2024-11-23 02:09:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:45,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:46,003 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-23 02:09:46,080 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:46,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:46,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:46,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:46,080 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:46,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:46,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:46,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2024-11-23 02:09:46,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:46,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:46,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:46,488 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:46,489 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,490 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-23 02:09:46,492 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-23 02:09:46,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,513 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-23 02:09:46,515 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-23 02:09:46,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,535 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-23 02:09:46,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,537 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-23 02:09:46,537 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-23 02:09:46,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-23 02:09:46,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:46,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,556 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-23 02:09:46,556 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-23 02:09:46,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,573 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-23 02:09:46,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,574 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-23 02:09:46,575 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-23 02:09:46,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,592 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-23 02:09:46,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,593 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-23 02:09:46,594 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-23 02:09:46,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-23 02:09:46,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:46,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,614 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-23 02:09:46,615 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-23 02:09:46,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,632 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-23 02:09:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,633 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-23 02:09:46,634 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-23 02:09:46,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,651 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-23 02:09:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,652 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-23 02:09:46,653 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-23 02:09:46,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-23 02:09:46,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,675 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-23 02:09:46,676 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-23 02:09:46,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-23 02:09:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,696 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-23 02:09:46,697 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-23 02:09:46,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,716 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-23 02:09:46,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,718 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-23 02:09:46,719 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-23 02:09:46,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:46,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:46,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,739 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-23 02:09:46,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,741 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-23 02:09:46,742 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-23 02:09:46,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,760 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-23 02:09:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,762 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-23 02:09:46,763 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-23 02:09:46,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-23 02:09:46,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:46,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:46,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,783 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-23 02:09:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,785 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-23 02:09:46,786 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-23 02:09:46,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,806 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-23 02:09:46,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,809 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-23 02:09:46,810 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-23 02:09:46,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,829 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-23 02:09:46,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,831 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-23 02:09:46,831 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-23 02:09:46,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,849 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-23 02:09:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,850 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-23 02:09:46,850 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-23 02:09:46,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,868 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-23 02:09:46,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,870 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-23 02:09:46,870 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-23 02:09:46,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-23 02:09:46,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,890 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-23 02:09:46,892 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-23 02:09:46,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,909 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-23 02:09:46,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,911 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-23 02:09:46,912 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-23 02:09:46,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-23 02:09:46,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,930 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-23 02:09:46,931 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-23 02:09:46,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,949 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-23 02:09:46,949 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-23 02:09:46,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-23 02:09:46,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-23 02:09:46,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,968 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-23 02:09:46,969 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-23 02:09:46,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:46,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:46,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:46,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:46,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:46,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-23 02:09:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:46,987 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-23 02:09:46,987 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-23 02:09:46,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:46,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:46,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:46,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:46,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,017 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-23 02:09:47,019 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-23 02:09:47,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:47,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,049 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-23 02:09:47,053 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-23 02:09:47,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-23 02:09:47,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,080 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-23 02:09:47,081 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-23 02:09:47,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-23 02:09:47,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-23 02:09:47,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,104 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-23 02:09:47,105 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-23 02:09:47,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,122 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-23 02:09:47,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,124 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-23 02:09:47,125 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-23 02:09:47,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-23 02:09:47,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,143 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-23 02:09:47,155 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-23 02:09:47,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:47,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,173 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-23 02:09:47,174 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-23 02:09:47,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-23 02:09:47,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-23 02:09:47,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,191 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-23 02:09:47,192 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-23 02:09:47,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,209 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-23 02:09:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,211 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-23 02:09:47,211 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-23 02:09:47,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,228 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-23 02:09:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,229 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-23 02:09:47,229 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-23 02:09:47,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-23 02:09:47,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,248 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-23 02:09:47,250 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-23 02:09:47,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-23 02:09:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,269 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-23 02:09:47,270 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-23 02:09:47,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,287 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-23 02:09:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,288 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-23 02:09:47,289 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-23 02:09:47,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-23 02:09:47,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,306 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-23 02:09:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,307 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-23 02:09:47,307 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-23 02:09:47,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-23 02:09:47,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:47,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:47,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:47,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,325 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-23 02:09:47,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,326 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-23 02:09:47,327 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-23 02:09:47,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,347 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-23 02:09:47,348 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-23 02:09:47,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,366 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-23 02:09:47,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,367 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-23 02:09:47,368 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-23 02:09:47,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,387 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-23 02:09:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,388 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-23 02:09:47,389 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-23 02:09:47,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-23 02:09:47,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,399 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:09:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,402 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-23 02:09:47,402 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:09:47,408 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,413 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-23 02:09:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,414 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-23 02:09:47,415 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-23 02:09:47,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-23 02:09:47,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,447 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-23 02:09:47,448 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-23 02:09:47,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,474 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-23 02:09:47,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,475 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-23 02:09:47,476 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-23 02:09:47,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,496 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-23 02:09:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,498 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-23 02:09:47,499 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-23 02:09:47,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:47,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-23 02:09:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,519 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-23 02:09:47,520 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-23 02:09:47,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:47,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:47,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:47,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:47,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:47,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:47,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:47,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:47,553 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-23 02:09:47,554 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-23 02:09:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:47,555 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-23 02:09:47,555 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-23 02:09:47,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:47,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:09:47,566 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:47,566 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-23 02:09:47,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-11-23 02:09:47,583 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-11-23 02:09:47,584 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:09:47,584 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:09:47,585 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2024-11-23 02:09:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:47,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:09:47,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:47,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:09:47,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:47,666 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-23 02:09:47,667 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-23 02:09:47,667 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-23 02:09:47,699 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-23 02:09:47,699 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-23 02:09:47,699 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-23 02:09:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-23 02:09:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-23 02:09:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-23 02:09:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-23 02:09:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:47,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-23 02:09:47,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:09:47,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2024-11-23 02:09:47,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-23 02:09:47,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-23 02:09:47,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-23 02:09:47,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:47,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-23 02:09:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-23 02:09:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-23 02:09:47,703 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-23 02:09:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-23 02:09:47,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-23 02:09:47,703 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-23 02:09:47,703 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:09:47,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2024-11-23 02:09:47,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:09:47,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:47,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:47,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:09:47,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:47,704 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-23 02:09:47,704 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-23 02:09:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2024-11-23 02:09:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:47,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951756375] [2024-11-23 02:09:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:47,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:47,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2024-11-23 02:09:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:47,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103177439] [2024-11-23 02:09:47,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:09:47,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:47,729 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:09:47,729 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:47,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:47,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:47,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2024-11-23 02:09:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:47,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118437170] [2024-11-23 02:09:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:47,920 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-23 02:09:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118437170] [2024-11-23 02:09:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118437170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:09:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:09:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 02:09:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570692646] [2024-11-23 02:09:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:09:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 02:09:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-23 02:09:47,957 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-23 02:09:48,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:48,092 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2024-11-23 02:09:48,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. [2024-11-23 02:09:48,093 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2024-11-23 02:09:48,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 93 transitions. [2024-11-23 02:09:48,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-23 02:09:48,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-23 02:09:48,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 93 transitions. [2024-11-23 02:09:48,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:48,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 93 transitions. [2024-11-23 02:09:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 93 transitions. [2024-11-23 02:09:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2024-11-23 02:09:48,097 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-23 02:09:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2024-11-23 02:09:48,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-11-23 02:09:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:09:48,100 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2024-11-23 02:09:48,100 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:09:48,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2024-11-23 02:09:48,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:09:48,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:48,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:48,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:09:48,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:48,105 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-23 02:09:48,105 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-23 02:09:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2024-11-23 02:09:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59442678] [2024-11-23 02:09:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:48,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:48,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:48,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2024-11-23 02:09:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392949152] [2024-11-23 02:09:48,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:09:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:48,137 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:09:48,137 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:48,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:48,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2024-11-23 02:09:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289154502] [2024-11-23 02:09:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:48,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:48,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:48,815 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:48,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:48,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:48,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:48,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:48,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:48,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:48,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:48,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2024-11-23 02:09:48,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:48,815 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:48,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:48,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:49,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:49,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:49,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:49,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:49,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:49,276 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,278 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-23 02:09:49,279 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-23 02:09:49,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,300 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-23 02:09:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,301 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-23 02:09:49,302 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-23 02:09:49,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,319 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-23 02:09:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,321 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-23 02:09:49,322 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-23 02:09:49,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,339 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-23 02:09:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,340 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-23 02:09:49,341 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-23 02:09:49,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,359 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-23 02:09:49,359 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-23 02:09:49,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,377 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-23 02:09:49,378 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-23 02:09:49,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-23 02:09:49,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,396 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-23 02:09:49,397 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-23 02:09:49,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-23 02:09:49,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-23 02:09:49,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,415 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-23 02:09:49,415 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-23 02:09:49,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,432 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-23 02:09:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,433 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-23 02:09:49,434 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-23 02:09:49,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-23 02:09:49,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,453 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-23 02:09:49,453 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-23 02:09:49,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,471 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-23 02:09:49,471 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-23 02:09:49,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,488 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-23 02:09:49,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,489 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-23 02:09:49,490 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-23 02:09:49,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,507 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-23 02:09:49,508 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-23 02:09:49,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,527 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-23 02:09:49,527 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-23 02:09:49,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,545 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-23 02:09:49,546 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-23 02:09:49,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,564 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-23 02:09:49,564 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-23 02:09:49,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,581 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-23 02:09:49,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,583 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-23 02:09:49,583 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-23 02:09:49,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-23 02:09:49,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,601 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-23 02:09:49,602 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-23 02:09:49,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,618 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-23 02:09:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,620 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-23 02:09:49,621 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-23 02:09:49,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-23 02:09:49,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-23 02:09:49,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,640 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-23 02:09:49,641 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-23 02:09:49,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-23 02:09:49,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,661 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-23 02:09:49,661 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-23 02:09:49,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:49,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:49,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-23 02:09:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,681 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-23 02:09:49,682 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-23 02:09:49,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:49,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:49,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,723 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-23 02:09:49,724 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-23 02:09:49,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-23 02:09:49,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-23 02:09:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,742 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-23 02:09:49,742 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-23 02:09:49,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,759 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-23 02:09:49,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,760 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-23 02:09:49,761 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-23 02:09:49,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:49,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:49,777 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-11-23 02:09:49,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,785 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-23 02:09:49,786 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-23 02:09:49,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-23 02:09:49,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,806 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-23 02:09:49,807 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-23 02:09:49,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-23 02:09:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,825 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-23 02:09:49,827 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-23 02:09:49,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-11-23 02:09:49,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,845 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-23 02:09:49,845 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-23 02:09:49,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,863 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-23 02:09:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,864 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-23 02:09:49,864 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-23 02:09:49,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,882 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-23 02:09:49,882 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-23 02:09:49,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,899 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-23 02:09:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,900 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-23 02:09:49,901 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-23 02:09:49,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,918 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-23 02:09:49,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,919 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-23 02:09:49,920 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-23 02:09:49,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,938 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-23 02:09:49,938 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-23 02:09:49,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,955 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-23 02:09:49,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,957 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-23 02:09:49,957 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-23 02:09:49,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,974 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-23 02:09:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,975 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-23 02:09:49,976 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-23 02:09:49,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:49,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:49,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:49,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:49,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:49,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:49,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:49,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:49,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:49,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-11-23 02:09:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:49,994 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-23 02:09:49,995 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-23 02:09:49,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-23 02:09:50,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:50,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:50,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:50,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:50,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:50,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:50,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:50,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:50,016 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-23 02:09:50,017 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-23 02:09:50,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:50,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:50,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:50,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:50,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:50,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:50,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:50,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:50,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-23 02:09:50,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:50,037 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-23 02:09:50,038 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-23 02:09:50,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:50,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:50,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:50,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:50,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:50,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:50,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:50,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:50,063 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-23 02:09:50,063 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-23 02:09:50,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:50,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:50,064 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-23 02:09:50,065 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-23 02:09:50,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:50,076 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:09:50,076 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:50,077 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-23 02:09:50,082 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-23 02:09:50,097 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-23 02:09:50,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2024-11-23 02:09:50,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:09:50,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:09:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:09:50,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:09:50,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:50,194 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-23 02:09:50,194 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-23 02:09:50,194 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-23 02:09:50,252 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-23 02:09:50,252 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-23 02:09:50,253 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-23 02:09:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2024-11-23 02:09:50,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 16 letters. Loop has 3 letters. [2024-11-23 02:09:50,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:50,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 19 letters. Loop has 3 letters. [2024-11-23 02:09:50,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:50,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 16 letters. Loop has 6 letters. [2024-11-23 02:09:50,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:50,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2024-11-23 02:09:50,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-23 02:09:50,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 94 transitions. [2024-11-23 02:09:50,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-11-23 02:09:50,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-23 02:09:50,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2024-11-23 02:09:50,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:50,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 94 transitions. [2024-11-23 02:09:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2024-11-23 02:09:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-11-23 02:09:50,259 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-23 02:09:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2024-11-23 02:09:50,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-23 02:09:50,259 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-23 02:09:50,259 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:09:50,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2024-11-23 02:09:50,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:50,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:50,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:50,260 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-23 02:09:50,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:09:50,260 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-23 02:09:50,261 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-23 02:09:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2024-11-23 02:09:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225942734] [2024-11-23 02:09:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,323 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-23 02:09:50,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:50,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225942734] [2024-11-23 02:09:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225942734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:09:50,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:09:50,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:09:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833784786] [2024-11-23 02:09:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:09:50,325 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:09:50,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2024-11-23 02:09:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051786523] [2024-11-23 02:09:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:50,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:50,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:50,356 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-23 02:09:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:09:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:09:50,444 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-23 02:09:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:50,468 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-11-23 02:09:50,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-23 02:09:50,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:50,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2024-11-23 02:09:50,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-23 02:09:50,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-23 02:09:50,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2024-11-23 02:09:50,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:50,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-23 02:09:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2024-11-23 02:09:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-23 02:09:50,472 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-23 02:09:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-11-23 02:09:50,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-23 02:09:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:09:50,474 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-11-23 02:09:50,474 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:09:50,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2024-11-23 02:09:50,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:50,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:50,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:50,475 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-23 02:09:50,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:09:50,475 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-23 02:09:50,475 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-23 02:09:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2024-11-23 02:09:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545299009] [2024-11-23 02:09:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,531 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-23 02:09:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545299009] [2024-11-23 02:09:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545299009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:09:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:09:50,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:09:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012542713] [2024-11-23 02:09:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:09:50,532 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:09:50,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,532 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2024-11-23 02:09:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694695546] [2024-11-23 02:09:50,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:09:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:50,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:09:50,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:50,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:50,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:09:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:09:50,620 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-23 02:09:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:50,654 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-23 02:09:50,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 104 transitions. [2024-11-23 02:09:50,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:50,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 61 states and 72 transitions. [2024-11-23 02:09:50,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-23 02:09:50,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-23 02:09:50,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 72 transitions. [2024-11-23 02:09:50,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:50,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-11-23 02:09:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 72 transitions. [2024-11-23 02:09:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-23 02:09:50,657 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-23 02:09:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-23 02:09:50,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-23 02:09:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 02:09:50,660 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-23 02:09:50,660 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:09:50,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2024-11-23 02:09:50,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:50,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:50,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:50,661 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-23 02:09:50,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:09:50,662 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-23 02:09:50,662 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-23 02:09:50,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2024-11-23 02:09:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247775331] [2024-11-23 02:09:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,847 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-23 02:09:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:09:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247775331] [2024-11-23 02:09:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247775331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:09:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426999810] [2024-11-23 02:09:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:50,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:09:50,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:50,850 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-23 02:09:50,851 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-23 02:09:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:50,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-23 02:09:50,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:50,938 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-23 02:09:51,142 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-23 02:09:51,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:09:51,347 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-23 02:09:51,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426999810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:09:51,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:09:51,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 29 [2024-11-23 02:09:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783215050] [2024-11-23 02:09:51,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:09:51,348 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:09:51,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2024-11-23 02:09:51,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:51,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896472549] [2024-11-23 02:09:51,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:09:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:51,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:09:51,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:51,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:51,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:09:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-23 02:09:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2024-11-23 02:09:51,463 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-23 02:09:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:09:52,084 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2024-11-23 02:09:52,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 216 transitions. [2024-11-23 02:09:52,085 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2024-11-23 02:09:52,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 161 states and 191 transitions. [2024-11-23 02:09:52,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-23 02:09:52,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2024-11-23 02:09:52,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 191 transitions. [2024-11-23 02:09:52,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:52,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 191 transitions. [2024-11-23 02:09:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 191 transitions. [2024-11-23 02:09:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2024-11-23 02:09:52,093 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-23 02:09:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-23 02:09:52,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-23 02:09:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-23 02:09:52,094 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-23 02:09:52,094 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:09:52,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 92 transitions. [2024-11-23 02:09:52,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-23 02:09:52,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:52,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:52,095 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-23 02:09:52,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:09:52,095 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-23 02:09:52,095 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-23 02:09:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2024-11-23 02:09:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:52,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080178829] [2024-11-23 02:09:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:52,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:52,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:52,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:52,148 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2024-11-23 02:09:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754402819] [2024-11-23 02:09:52,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:09:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:52,153 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:09:52,154 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:09:52,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:52,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:52,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2024-11-23 02:09:52,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:52,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461200428] [2024-11-23 02:09:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:52,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:52,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:53,640 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:53,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:53,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:53,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:53,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:53,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:53,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:53,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:53,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2024-11-23 02:09:53,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:53,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:53,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:53,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:54,283 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:54,283 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:54,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,286 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-23 02:09:54,289 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-23 02:09:54,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,309 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-23 02:09:54,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,311 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-23 02:09:54,311 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-23 02:09:54,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,329 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-23 02:09:54,330 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-23 02:09:54,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,347 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-23 02:09:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,348 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-23 02:09:54,348 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-23 02:09:54,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,365 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-23 02:09:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,366 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-23 02:09:54,367 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-23 02:09:54,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,385 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-23 02:09:54,385 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-23 02:09:54,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,402 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-23 02:09:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,403 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-23 02:09:54,403 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-23 02:09:54,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,420 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-23 02:09:54,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,421 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-23 02:09:54,421 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-23 02:09:54,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-23 02:09:54,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,438 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-23 02:09:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,439 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-23 02:09:54,439 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-23 02:09:54,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-23 02:09:54,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,458 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:09:54,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-23 02:09:54,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,477 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-23 02:09:54,477 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-23 02:09:54,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,496 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-23 02:09:54,496 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-23 02:09:54,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,513 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-23 02:09:54,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,515 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-23 02:09:54,516 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-23 02:09:54,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,532 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-23 02:09:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,533 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-23 02:09:54,534 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-23 02:09:54,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,550 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-23 02:09:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,552 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-23 02:09:54,552 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-23 02:09:54,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:54,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:54,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:54,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,570 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-23 02:09:54,571 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-23 02:09:54,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-23 02:09:54,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:54,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:54,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,593 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-23 02:09:54,595 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-23 02:09:54,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-23 02:09:54,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,605 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-23 02:09:54,605 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:09:54,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,616 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-23 02:09:54,616 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:09:54,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-11-23 02:09:54,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,642 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-23 02:09:54,644 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-23 02:09:54,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:54,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:54,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:54,663 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-23 02:09:54,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,666 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-23 02:09:54,666 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-23 02:09:54,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:54,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:54,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:54,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:54,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:54,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:54,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:54,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:54,702 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-23 02:09:54,702 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-23 02:09:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:54,704 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-23 02:09:54,705 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-23 02:09:54,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:54,715 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-23 02:09:54,716 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:54,716 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-23 02:09:54,721 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-23 02:09:54,756 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-23 02:09:54,757 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2024-11-23 02:09:54,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:54,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-23 02:09:54,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:54,816 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-23 02:09:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:09:54,897 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-23 02:09:54,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:09:54,903 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-23 02:09:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:54,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:09:54,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:09:55,038 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-23 02:09:55,039 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-23 02:09:55,039 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-23 02:09:55,155 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-23 02:09:55,156 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-23 02:09:55,156 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-23 02:09:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2024-11-23 02:09:55,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 30 letters. Loop has 4 letters. [2024-11-23 02:09:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 34 letters. Loop has 4 letters. [2024-11-23 02:09:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:55,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 30 letters. Loop has 8 letters. [2024-11-23 02:09:55,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:09:55,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 171 transitions. [2024-11-23 02:09:55,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:09:55,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 165 transitions. [2024-11-23 02:09:55,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-23 02:09:55,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-11-23 02:09:55,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 165 transitions. [2024-11-23 02:09:55,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:09:55,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-23 02:09:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 165 transitions. [2024-11-23 02:09:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-23 02:09:55,161 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-23 02:09:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-23 02:09:55,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-23 02:09:55,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-23 02:09:55,162 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:09:55,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 160 transitions. [2024-11-23 02:09:55,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:09:55,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:09:55,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:09:55,163 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-23 02:09:55,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:09:55,163 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-23 02:09:55,164 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-23 02:09:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2024-11-23 02:09:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833676217] [2024-11-23 02:09:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2024-11-23 02:09:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159207232] [2024-11-23 02:09:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:55,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2024-11-23 02:09:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:09:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497173911] [2024-11-23 02:09:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:09:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:09:55,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:09:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:09:55,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:09:58,123 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:09:58,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:09:58,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:09:58,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:09:58,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:09:58,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:58,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:09:58,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:09:58,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2024-11-23 02:09:58,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:09:58,123 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:09:58,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:58,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:09:59,062 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:09:59,062 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:09:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,064 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-23 02:09:59,064 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-23 02:09:59,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,081 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-23 02:09:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,083 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-23 02:09:59,083 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-23 02:09:59,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,103 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-23 02:09:59,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,104 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-23 02:09:59,105 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-23 02:09:59,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-23 02:09:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,124 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-23 02:09:59,124 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-23 02:09:59,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-23 02:09:59,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,143 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-23 02:09:59,144 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-23 02:09:59,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,166 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-23 02:09:59,167 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-23 02:09:59,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,184 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-23 02:09:59,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,185 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-23 02:09:59,186 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-23 02:09:59,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,204 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-23 02:09:59,205 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-23 02:09:59,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,222 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-23 02:09:59,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,223 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-23 02:09:59,224 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-23 02:09:59,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-23 02:09:59,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,242 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-23 02:09:59,243 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-23 02:09:59,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,261 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-23 02:09:59,261 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-23 02:09:59,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,281 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-23 02:09:59,281 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-23 02:09:59,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-23 02:09:59,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,297 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-23 02:09:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,299 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-23 02:09:59,299 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-23 02:09:59,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,317 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-23 02:09:59,317 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-23 02:09:59,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,336 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-23 02:09:59,337 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-23 02:09:59,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,354 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-23 02:09:59,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,355 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-23 02:09:59,356 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-23 02:09:59,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,373 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-23 02:09:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,374 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-23 02:09:59,374 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-23 02:09:59,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,392 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-23 02:09:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,393 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-23 02:09:59,393 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-23 02:09:59,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-23 02:09:59,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,411 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-23 02:09:59,424 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-23 02:09:59,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,443 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-23 02:09:59,444 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-23 02:09:59,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-23 02:09:59,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,462 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-23 02:09:59,463 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-23 02:09:59,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-23 02:09:59,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,480 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-23 02:09:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,481 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-23 02:09:59,482 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-23 02:09:59,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,498 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-23 02:09:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,500 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-23 02:09:59,500 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-23 02:09:59,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-11-23 02:09:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,518 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-23 02:09:59,519 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-23 02:09:59,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-23 02:09:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,537 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-23 02:09:59,538 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-23 02:09:59,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,555 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-23 02:09:59,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,557 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-23 02:09:59,558 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-23 02:09:59,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-23 02:09:59,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,579 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-23 02:09:59,580 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-23 02:09:59,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,597 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-23 02:09:59,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,598 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-23 02:09:59,598 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-23 02:09:59,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:09:59,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:09:59,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:09:59,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,616 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-23 02:09:59,617 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-23 02:09:59,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,637 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-23 02:09:59,638 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-23 02:09:59,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-11-23 02:09:59,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,661 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-23 02:09:59,662 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-23 02:09:59,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,689 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-23 02:09:59,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,690 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-23 02:09:59,690 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-23 02:09:59,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-23 02:09:59,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,701 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-23 02:09:59,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,704 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-23 02:09:59,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,716 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-23 02:09:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,717 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-23 02:09:59,718 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-23 02:09:59,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:09:59,736 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-23 02:09:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,737 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-23 02:09:59,737 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-23 02:09:59,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:09:59,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:09:59,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:09:59,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:09:59,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:09:59,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:09:59,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:09:59,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:09:59,812 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2024-11-23 02:09:59,813 INFO L444 ModelExtractionUtils]: 5 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-11-23 02:09:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:09:59,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:09:59,815 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-23 02:09:59,815 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-23 02:09:59,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:09:59,827 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:09:59,827 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:09:59,827 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-23 02:09:59,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-11-23 02:09:59,894 INFO L156 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2024-11-23 02:09:59,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~d~0!offset [2024-11-23 02:09:59,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:09:59,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:09:59,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:09:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:09:59,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 02:09:59,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:00,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:10:00,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:00,069 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-23 02:10:00,073 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-23 02:10:00,073 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-23 02:10:00,116 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-23 02:10:00,116 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-23 02:10:00,117 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-23 02:10:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2024-11-23 02:10:00,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 32 letters. Loop has 3 letters. [2024-11-23 02:10:00,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:00,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 35 letters. Loop has 3 letters. [2024-11-23 02:10:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:00,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 39 transitions. Stem has 32 letters. Loop has 6 letters. [2024-11-23 02:10:00,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:00,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 208 transitions. [2024-11-23 02:10:00,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-23 02:10:00,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 158 states and 191 transitions. [2024-11-23 02:10:00,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2024-11-23 02:10:00,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-11-23 02:10:00,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 191 transitions. [2024-11-23 02:10:00,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:00,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 191 transitions. [2024-11-23 02:10:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 191 transitions. [2024-11-23 02:10:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2024-11-23 02:10:00,129 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-23 02:10:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2024-11-23 02:10:00,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-23 02:10:00,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-23 02:10:00,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-23 02:10:00,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2024-11-23 02:10:00,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-23 02:10:00,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:00,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:00,131 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-23 02:10:00,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:10:00,131 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-23 02:10:00,133 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-23 02:10:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2104844943, now seen corresponding path program 2 times [2024-11-23 02:10:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584454205] [2024-11-23 02:10:00,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:00,150 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:10:00,150 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:00,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:00,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 5 times [2024-11-23 02:10:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730679608] [2024-11-23 02:10:00,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:10:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:00,174 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:00,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:00,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:00,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:00,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 671339115, now seen corresponding path program 2 times [2024-11-23 02:10:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:00,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521495995] [2024-11-23 02:10:00,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:00,190 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:10:00,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:00,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:00,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:01,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-23 02:10:01,765 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:10:01,766 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:10:01,766 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:10:01,766 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:10:01,766 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:10:01,766 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:01,766 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:10:01,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:10:01,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration13_Lasso [2024-11-23 02:10:01,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:10:01,766 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:10:01,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:01,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:02,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:10:02,334 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:10:02,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,336 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-23 02:10:02,337 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-23 02:10:02,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,347 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-23 02:10:02,348 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:10:02,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,357 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-23 02:10:02,357 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:10:02,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-11-23 02:10:02,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,383 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-23 02:10:02,383 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-23 02:10:02,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,405 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-23 02:10:02,405 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-23 02:10:02,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:02,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,429 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-23 02:10:02,430 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-23 02:10:02,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-23 02:10:02,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:02,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,451 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-23 02:10:02,452 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-23 02:10:02,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,470 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-23 02:10:02,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,471 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-23 02:10:02,472 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-23 02:10:02,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:02,493 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-23 02:10:02,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,494 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-23 02:10:02,494 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-23 02:10:02,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:02,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:02,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:02,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:02,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:02,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:02,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:02,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:10:02,520 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-23 02:10:02,520 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-23 02:10:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:02,521 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-23 02:10:02,522 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-23 02:10:02,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:10:02,533 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:10:02,533 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:10:02,534 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-23 02:10:02,539 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-23 02:10:02,560 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-11-23 02:10:02,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:10:02,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:10:02,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~haystack!offset [2024-11-23 02:10:02,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:02,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:10:02,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:02,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:10:02,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:02,650 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-23 02:10:02,651 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-23 02:10:02,651 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-23 02:10:02,663 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-23 02:10:02,663 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-23 02:10:02,663 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-23 02:10:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2024-11-23 02:10:02,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-23 02:10:02,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:02,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 36 letters. Loop has 4 letters. [2024-11-23 02:10:02,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:02,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 32 letters. Loop has 8 letters. [2024-11-23 02:10:02,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:02,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 244 transitions. [2024-11-23 02:10:02,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:02,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 158 states and 192 transitions. [2024-11-23 02:10:02,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-23 02:10:02,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-23 02:10:02,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 192 transitions. [2024-11-23 02:10:02,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:02,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 192 transitions. [2024-11-23 02:10:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 192 transitions. [2024-11-23 02:10:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2024-11-23 02:10:02,673 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-23 02:10:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-11-23 02:10:02,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-11-23 02:10:02,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-11-23 02:10:02,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-23 02:10:02,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 111 transitions. [2024-11-23 02:10:02,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:02,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:02,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:02,675 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-23 02:10:02,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:02,675 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-23 02:10:02,675 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-23 02:10:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -840479618, now seen corresponding path program 1 times [2024-11-23 02:10:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764676289] [2024-11-23 02:10:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:02,712 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-23 02:10:02,766 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-23 02:10:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764676289] [2024-11-23 02:10:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764676289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:10:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:10:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:10:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390627324] [2024-11-23 02:10:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:02,768 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2024-11-23 02:10:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630169095] [2024-11-23 02:10:02,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:02,772 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:02,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:02,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:02,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:10:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:10:02,855 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-23 02:10:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:02,864 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2024-11-23 02:10:02,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 112 transitions. [2024-11-23 02:10:02,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:02,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 92 states and 108 transitions. [2024-11-23 02:10:02,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-23 02:10:02,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-23 02:10:02,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 108 transitions. [2024-11-23 02:10:02,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:02,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-23 02:10:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 108 transitions. [2024-11-23 02:10:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-23 02:10:02,866 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-23 02:10:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2024-11-23 02:10:02,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-23 02:10:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:10:02,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 108 transitions. [2024-11-23 02:10:02,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-23 02:10:02,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 108 transitions. [2024-11-23 02:10:02,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:02,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:02,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:02,871 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-23 02:10:02,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:02,871 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-23 02:10:02,871 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-23 02:10:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 762752838, now seen corresponding path program 1 times [2024-11-23 02:10:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663071495] [2024-11-23 02:10:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:03,058 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-23 02:10:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663071495] [2024-11-23 02:10:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663071495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685078731] [2024-11-23 02:10:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:03,062 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-23 02:10:03,062 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-23 02:10:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:03,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-23 02:10:03,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:03,176 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-23 02:10:03,194 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-23 02:10:03,253 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-23 02:10:03,253 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-23 02:10:03,263 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-23 02:10:03,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:03,309 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-23 02:10:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685078731] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-23 02:10:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 8] total 20 [2024-11-23 02:10:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193252506] [2024-11-23 02:10:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:03,310 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:03,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2024-11-23 02:10:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384772093] [2024-11-23 02:10:03,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:10:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:03,314 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:10:03,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:03,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:03,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:03,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:10:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2024-11-23 02:10:03,393 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-23 02:10:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:03,455 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-23 02:10:03,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 120 transitions. [2024-11-23 02:10:03,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:03,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 102 states and 118 transitions. [2024-11-23 02:10:03,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-23 02:10:03,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-23 02:10:03,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 118 transitions. [2024-11-23 02:10:03,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:03,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 118 transitions. [2024-11-23 02:10:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 118 transitions. [2024-11-23 02:10:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-23 02:10:03,458 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-23 02:10:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2024-11-23 02:10:03,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-11-23 02:10:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:10:03,459 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-11-23 02:10:03,459 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-23 02:10:03,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 112 transitions. [2024-11-23 02:10:03,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:03,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:03,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:03,460 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-23 02:10:03,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:03,460 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-23 02:10:03,460 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-23 02:10:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash -649369423, now seen corresponding path program 1 times [2024-11-23 02:10:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469250214] [2024-11-23 02:10:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:03,597 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-23 02:10:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469250214] [2024-11-23 02:10:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469250214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619981476] [2024-11-23 02:10:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:03,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:03,600 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-23 02:10:03,600 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-23 02:10:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:03,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-23 02:10:03,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:03,783 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-23 02:10:03,827 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-23 02:10:03,828 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-23 02:10:03,929 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-23 02:10:03,929 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-23 02:10:04,249 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-23 02:10:04,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:04,516 INFO L349 Elim1Store]: treesize reduction 19, result has 45.7 percent of original size [2024-11-23 02:10:04,516 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-23 02:10:04,592 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-23 02:10:04,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:04,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2024-11-23 02:10:04,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:04,612 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-23 02:10:04,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:04,624 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-23 02:10:04,723 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-23 02:10:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619981476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:04,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 36 [2024-11-23 02:10:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232700230] [2024-11-23 02:10:04,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:04,724 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2024-11-23 02:10:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188680938] [2024-11-23 02:10:04,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:10:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:04,728 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:10:04,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:04,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:04,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-23 02:10:04,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2024-11-23 02:10:04,810 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-23 02:10:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:05,931 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2024-11-23 02:10:05,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 276 transitions. [2024-11-23 02:10:05,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:05,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 178 states and 204 transitions. [2024-11-23 02:10:05,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2024-11-23 02:10:05,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2024-11-23 02:10:05,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 204 transitions. [2024-11-23 02:10:05,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:05,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-23 02:10:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 204 transitions. [2024-11-23 02:10:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-11-23 02:10:05,935 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-23 02:10:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2024-11-23 02:10:05,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 177 transitions. [2024-11-23 02:10:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-23 02:10:05,936 INFO L425 stractBuchiCegarLoop]: Abstraction has 153 states and 177 transitions. [2024-11-23 02:10:05,936 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-23 02:10:05,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 177 transitions. [2024-11-23 02:10:05,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:05,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:05,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:05,936 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-23 02:10:05,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:05,937 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-23 02:10:05,937 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-23 02:10:05,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1758913841, now seen corresponding path program 1 times [2024-11-23 02:10:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:05,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842737606] [2024-11-23 02:10:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:06,138 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-23 02:10:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842737606] [2024-11-23 02:10:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842737606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147272836] [2024-11-23 02:10:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:06,140 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-23 02:10:06,140 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-23 02:10:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:06,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-23 02:10:06,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:06,270 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-23 02:10:06,299 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-23 02:10:06,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:06,311 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-23 02:10:06,313 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-23 02:10:06,345 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-23 02:10:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147272836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:06,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-23 02:10:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327093025] [2024-11-23 02:10:06,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:06,346 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2024-11-23 02:10:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572712009] [2024-11-23 02:10:06,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:10:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:06,351 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:06,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:06,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:06,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 02:10:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-23 02:10:06,425 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-23 02:10:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:06,646 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2024-11-23 02:10:06,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 157 transitions. [2024-11-23 02:10:06,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:06,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 120 states and 136 transitions. [2024-11-23 02:10:06,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-23 02:10:06,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-23 02:10:06,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 136 transitions. [2024-11-23 02:10:06,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:06,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-23 02:10:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 136 transitions. [2024-11-23 02:10:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2024-11-23 02:10:06,648 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-23 02:10:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-23 02:10:06,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-23 02:10:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-23 02:10:06,651 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-23 02:10:06,651 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-23 02:10:06,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 122 transitions. [2024-11-23 02:10:06,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:06,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:06,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:06,652 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-23 02:10:06,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:06,652 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-23 02:10:06,652 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-23 02:10:06,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 914730776, now seen corresponding path program 2 times [2024-11-23 02:10:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447462226] [2024-11-23 02:10:06,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:06,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:10:06,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:06,859 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-23 02:10:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447462226] [2024-11-23 02:10:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447462226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078751271] [2024-11-23 02:10:06,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:06,862 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-23 02:10:06,862 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-23 02:10:06,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:10:06,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:06,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-23 02:10:06,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:07,356 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-23 02:10:07,356 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-23 02:10:07,369 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-23 02:10:07,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:07,693 INFO L349 Elim1Store]: treesize reduction 39, result has 59.8 percent of original size [2024-11-23 02:10:07,694 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-23 02:10:07,731 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-23 02:10:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078751271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:07,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 34 [2024-11-23 02:10:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640709768] [2024-11-23 02:10:07,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:07,732 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2024-11-23 02:10:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852969753] [2024-11-23 02:10:07,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:10:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:07,736 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:10:07,736 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:07,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:07,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-23 02:10:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2024-11-23 02:10:07,822 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-23 02:10:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:08,743 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2024-11-23 02:10:08,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 246 transitions. [2024-11-23 02:10:08,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:08,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 209 states and 239 transitions. [2024-11-23 02:10:08,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-23 02:10:08,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-23 02:10:08,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 239 transitions. [2024-11-23 02:10:08,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:08,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 239 transitions. [2024-11-23 02:10:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 239 transitions. [2024-11-23 02:10:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 136. [2024-11-23 02:10:08,747 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-23 02:10:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2024-11-23 02:10:08,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-11-23 02:10:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-23 02:10:08,747 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-11-23 02:10:08,748 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-23 02:10:08,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 154 transitions. [2024-11-23 02:10:08,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:08,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:08,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:08,748 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-23 02:10:08,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:08,749 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-23 02:10:08,749 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-23 02:10:08,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1771858513, now seen corresponding path program 3 times [2024-11-23 02:10:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565530845] [2024-11-23 02:10:08,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:10:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:08,779 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 02:10:08,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-23 02:10:09,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565530845] [2024-11-23 02:10:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565530845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215284016] [2024-11-23 02:10:09,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:10:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:09,555 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-23 02:10:09,556 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-23 02:10:09,677 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 02:10:09,677 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:09,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-23 02:10:09,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:09,683 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-23 02:10:09,738 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-23 02:10:09,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:10:09,762 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-23 02:10:09,790 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-23 02:10:09,800 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-23 02:10:09,819 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-23 02:10:10,304 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-23 02:10:10,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:10,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:10,871 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-23 02:10:10,894 INFO L349 Elim1Store]: treesize reduction 10, result has 78.7 percent of original size [2024-11-23 02:10:10,894 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-23 02:10:10,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:10,912 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-23 02:10:11,168 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-23 02:10:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215284016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:11,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 44 [2024-11-23 02:10:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969575330] [2024-11-23 02:10:11,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:11,169 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:11,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2024-11-23 02:10:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:11,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624482516] [2024-11-23 02:10:11,169 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:10:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:11,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:11,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:11,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:11,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-23 02:10:11,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1754, Unknown=5, NotChecked=0, Total=1980 [2024-11-23 02:10:11,248 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. cyclomatic complexity: 29 Second operand has 45 states, 44 states have (on average 2.75) internal successors, (121), 45 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:12,356 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2024-11-23 02:10:12,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 275 transitions. [2024-11-23 02:10:12,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:12,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 243 states and 273 transitions. [2024-11-23 02:10:12,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-23 02:10:12,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-23 02:10:12,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 273 transitions. [2024-11-23 02:10:12,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:12,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 273 transitions. [2024-11-23 02:10:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 273 transitions. [2024-11-23 02:10:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2024-11-23 02:10:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.1313131313131313) internal successors, (224), 197 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2024-11-23 02:10:12,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 224 transitions. [2024-11-23 02:10:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-23 02:10:12,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 198 states and 224 transitions. [2024-11-23 02:10:12,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-23 02:10:12,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 224 transitions. [2024-11-23 02:10:12,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:12,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:12,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:12,364 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-23 02:10:12,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:12,364 INFO L745 eck$LassoCheckResult]: Stem: 6856#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6822#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; 6823#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; 6806#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6807#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; 6819#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; 6813#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; 6814#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 6815#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; 6816#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 6928#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6929#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; 6838#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6824#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6825#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; 6836#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; 6826#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6827#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; 6996#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; 6995#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6994#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; 6993#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; 6992#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6990#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; 6991#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; 6989#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6851#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 6852#L510-5 strlen_#res#1 := strlen_~i~0#1; 6847#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; 6837#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6829#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 6830#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 6833#L510-11 strlen_#res#1 := strlen_~i~0#1; 6839#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; 6828#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6820#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); 6821#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; 6858#L533 assume !strstr_#t~short16#1; 6882#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; 6885#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; 6883#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; 6881#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; 6879#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6872#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); 6876#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; 6871#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6873#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); 6868#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6867#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; 6865#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; 6863#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; 6862#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; 6848#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; 6841#L518-3 [2024-11-23 02:10:12,366 INFO L747 eck$LassoCheckResult]: Loop: 6841#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6853#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); 6840#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; 6841#L518-3 [2024-11-23 02:10:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1242070257, now seen corresponding path program 1 times [2024-11-23 02:10:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865015413] [2024-11-23 02:10:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:12,486 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-23 02:10:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:12,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865015413] [2024-11-23 02:10:12,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865015413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:10:12,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:10:12,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:10:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826898448] [2024-11-23 02:10:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:10:12,487 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:12,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2024-11-23 02:10:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375767243] [2024-11-23 02:10:12,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:12,492 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:12,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:12,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:12,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:10:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:10:12,580 INFO L87 Difference]: Start difference. First operand 198 states and 224 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-23 02:10:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:12,600 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2024-11-23 02:10:12,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 220 transitions. [2024-11-23 02:10:12,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:12,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 159 states and 180 transitions. [2024-11-23 02:10:12,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-11-23 02:10:12,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2024-11-23 02:10:12,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 180 transitions. [2024-11-23 02:10:12,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:12,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 180 transitions. [2024-11-23 02:10:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 180 transitions. [2024-11-23 02:10:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2024-11-23 02:10:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 141 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2024-11-23 02:10:12,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 161 transitions. [2024-11-23 02:10:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:10:12,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 161 transitions. [2024-11-23 02:10:12,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-23 02:10:12,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 161 transitions. [2024-11-23 02:10:12,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:12,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:12,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:12,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 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-23 02:10:12,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:12,607 INFO L745 eck$LassoCheckResult]: Stem: 7259#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7221#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; 7222#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; 7209#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; 7210#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 7211#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; 7213#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 7345#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7344#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; 7343#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; 7342#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; 7341#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7340#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; 7338#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7337#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7336#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; 7241#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7242#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7334#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; 7332#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; 7330#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7328#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; 7326#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; 7323#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7321#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7319#L510-5 strlen_#res#1 := strlen_~i~0#1; 7317#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; 7315#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7314#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7313#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; 7312#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; 7311#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7304#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; 7310#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; 7309#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7234#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 7235#L510-11 strlen_#res#1 := strlen_~i~0#1; 7243#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; 7230#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7223#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); 7224#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; 7262#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; 7289#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7286#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); 7246#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; 7247#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7287#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); 7273#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7271#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; 7269#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; 7267#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; 7266#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; 7252#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; 7245#L518-3 [2024-11-23 02:10:12,607 INFO L747 eck$LassoCheckResult]: Loop: 7245#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7256#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); 7244#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; 7245#L518-3 [2024-11-23 02:10:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash -131927407, now seen corresponding path program 4 times [2024-11-23 02:10:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174844372] [2024-11-23 02:10:12,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:10:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:12,639 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:10:12,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 02:10:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174844372] [2024-11-23 02:10:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174844372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431843988] [2024-11-23 02:10:12,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:10:12,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:12,871 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-23 02:10:12,871 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-23 02:10:13,040 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:10:13,040 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:13,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 02:10:13,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 02:10:13,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 02:10:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431843988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:13,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2024-11-23 02:10:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129744668] [2024-11-23 02:10:13,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:13,421 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:13,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2024-11-23 02:10:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:13,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411830038] [2024-11-23 02:10:13,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:10:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:13,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:10:13,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:13,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:13,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-23 02:10:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2024-11-23 02:10:13,505 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. cyclomatic complexity: 31 Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:13,672 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2024-11-23 02:10:13,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 305 transitions. [2024-11-23 02:10:13,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:13,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 231 states and 262 transitions. [2024-11-23 02:10:13,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2024-11-23 02:10:13,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2024-11-23 02:10:13,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 262 transitions. [2024-11-23 02:10:13,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:13,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 262 transitions. [2024-11-23 02:10:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 262 transitions. [2024-11-23 02:10:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 148. [2024-11-23 02:10:13,675 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-23 02:10:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2024-11-23 02:10:13,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-23 02:10:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 02:10:13,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 148 states and 167 transitions. [2024-11-23 02:10:13,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-23 02:10:13,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 167 transitions. [2024-11-23 02:10:13,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:13,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:13,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:13,678 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-23 02:10:13,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:13,678 INFO L745 eck$LassoCheckResult]: Stem: 8027#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7987#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; 7988#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; 7973#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; 7974#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 7978#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7985#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; 7986#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; 7979#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; 7980#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 7981#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; 7982#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 8040#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8041#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; 8005#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8006#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8076#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; 8077#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; 7993#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7994#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; 8026#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; 8073#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8074#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; 8120#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; 8119#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8024#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8025#L510-5 strlen_#res#1 := strlen_~i~0#1; 8117#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; 8004#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7996#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7997#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; 8001#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; 8023#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 7999#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8000#L510-11 strlen_#res#1 := strlen_~i~0#1; 8062#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; 8061#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8060#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); 8059#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; 8057#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; 8056#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8054#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); 8055#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; 8053#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8052#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); 8051#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8031#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; 8032#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; 8065#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; 8063#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; 8048#L533 assume !strstr_#t~short16#1; 8047#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; 8045#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; 8042#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; 8019#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; 8010#L518-3 [2024-11-23 02:10:13,678 INFO L747 eck$LassoCheckResult]: Loop: 8010#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8028#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); 8009#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; 8010#L518-3 [2024-11-23 02:10:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1146910187, now seen corresponding path program 1 times [2024-11-23 02:10:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972767032] [2024-11-23 02:10:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:13,877 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-23 02:10:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972767032] [2024-11-23 02:10:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972767032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132818105] [2024-11-23 02:10:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:10:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:13,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:13,879 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-23 02:10:13,880 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-23 02:10:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:14,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 02:10:14,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:14,074 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-23 02:10:14,133 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-23 02:10:14,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:14,147 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-23 02:10:14,148 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-23 02:10:14,191 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-23 02:10:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132818105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:14,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:14,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 23 [2024-11-23 02:10:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794821288] [2024-11-23 02:10:14,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:14,192 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:14,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 10 times [2024-11-23 02:10:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:14,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484731172] [2024-11-23 02:10:14,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:10:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:14,196 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:10:14,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:14,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:14,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:14,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-23 02:10:14,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-23 02:10:14,276 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. cyclomatic complexity: 31 Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:14,608 INFO L93 Difference]: Finished difference Result 327 states and 368 transitions. [2024-11-23 02:10:14,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 368 transitions. [2024-11-23 02:10:14,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:14,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 315 states and 356 transitions. [2024-11-23 02:10:14,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2024-11-23 02:10:14,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2024-11-23 02:10:14,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 356 transitions. [2024-11-23 02:10:14,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:14,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 356 transitions. [2024-11-23 02:10:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 356 transitions. [2024-11-23 02:10:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 186. [2024-11-23 02:10:14,614 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-23 02:10:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2024-11-23 02:10:14,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 209 transitions. [2024-11-23 02:10:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-23 02:10:14,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 209 transitions. [2024-11-23 02:10:14,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-23 02:10:14,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 209 transitions. [2024-11-23 02:10:14,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:14,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:14,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:14,616 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-23 02:10:14,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:14,616 INFO L745 eck$LassoCheckResult]: Stem: 8877#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8836#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; 8837#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; 8820#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; 8821#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 8822#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; 8824#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 8825#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 8832#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; 8833#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; 8826#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; 8827#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 8828#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; 8829#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 8927#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8928#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; 8914#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8915#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8891#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; 8892#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; 8908#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8909#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; 8849#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; 8850#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8961#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8987#L510-5 strlen_#res#1 := strlen_~i~0#1; 8986#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; 8985#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8984#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8982#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; 8980#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; 8978#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8976#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; 8975#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; 8974#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8945#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; 8971#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; 8970#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 8969#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 8936#L510-11 strlen_#res#1 := strlen_~i~0#1; 8878#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; 8842#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8834#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); 8835#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; 8881#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; 8935#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8932#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); 8934#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; 8931#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8933#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); 8894#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8890#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; 8888#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; 8886#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; 8885#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; 8867#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; 8859#L518-3 [2024-11-23 02:10:14,617 INFO L747 eck$LassoCheckResult]: Loop: 8859#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8874#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); 8858#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; 8859#L518-3 [2024-11-23 02:10:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1303219306, now seen corresponding path program 5 times [2024-11-23 02:10:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:14,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871313796] [2024-11-23 02:10:14,617 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:10:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:14,653 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-23 02:10:14,654 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 02:10:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871313796] [2024-11-23 02:10:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871313796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800460967] [2024-11-23 02:10:15,006 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:10:15,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:15,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:15,008 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-23 02:10:15,009 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-23 02:10:15,145 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-23 02:10:15,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:15,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-23 02:10:15,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:15,153 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-23 02:10:15,230 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-23 02:10:15,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-23 02:10:15,250 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-23 02:10:15,273 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-23 02:10:15,279 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-23 02:10:15,288 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-23 02:10:15,382 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 7 treesize of output 3 [2024-11-23 02:10:15,399 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-23 02:10:15,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:15,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:15,559 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-23 02:10:15,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 02:10:15,563 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-23 02:10:15,569 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 11 treesize of output 7 [2024-11-23 02:10:15,763 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-23 02:10:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800460967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:15,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2024-11-23 02:10:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593511327] [2024-11-23 02:10:15,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:15,764 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 11 times [2024-11-23 02:10:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865978415] [2024-11-23 02:10:15,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:10:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:15,769 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:10:15,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:15,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:15,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-23 02:10:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1222, Unknown=9, NotChecked=0, Total=1332 [2024-11-23 02:10:15,854 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. cyclomatic complexity: 35 Second operand has 37 states, 37 states have (on average 2.6216216216216215) internal successors, (97), 37 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-23 02:10:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:16,560 INFO L93 Difference]: Finished difference Result 333 states and 373 transitions. [2024-11-23 02:10:16,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 373 transitions. [2024-11-23 02:10:16,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:16,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 289 states and 325 transitions. [2024-11-23 02:10:16,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2024-11-23 02:10:16,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2024-11-23 02:10:16,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 325 transitions. [2024-11-23 02:10:16,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:16,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 289 states and 325 transitions. [2024-11-23 02:10:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 325 transitions. [2024-11-23 02:10:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 217. [2024-11-23 02:10:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 1.119815668202765) internal successors, (243), 216 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 243 transitions. [2024-11-23 02:10:16,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 217 states and 243 transitions. [2024-11-23 02:10:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 02:10:16,568 INFO L425 stractBuchiCegarLoop]: Abstraction has 217 states and 243 transitions. [2024-11-23 02:10:16,568 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-23 02:10:16,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 243 transitions. [2024-11-23 02:10:16,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:16,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:16,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:16,569 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-23 02:10:16,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:16,570 INFO L745 eck$LassoCheckResult]: Stem: 9803#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9760#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; 9761#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; 9747#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; 9748#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 9749#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; 9751#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 9752#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 9833#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; 9811#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; 9812#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; 9793#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 9794#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; 9849#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 9850#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; 9843#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 9844#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 9757#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; 9758#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9764#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9765#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; 9777#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; 9766#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9767#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; 9923#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; 9922#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9914#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; 9913#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; 9910#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9907#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 9906#L510-5 strlen_#res#1 := strlen_~i~0#1; 9904#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; 9903#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9902#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9894#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; 9891#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; 9889#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9888#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; 9886#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; 9883#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 9882#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 9881#L510-11 strlen_#res#1 := strlen_~i~0#1; 9880#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; 9879#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 9878#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); 9807#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; 9808#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; 9951#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9950#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); 9785#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; 9786#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9809#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); 9810#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 9836#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; 9834#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; 9831#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; 9817#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; 9791#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; 9784#L518-3 [2024-11-23 02:10:16,571 INFO L747 eck$LassoCheckResult]: Loop: 9784#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9800#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); 9783#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; 9784#L518-3 [2024-11-23 02:10:16,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2019938312, now seen corresponding path program 6 times [2024-11-23 02:10:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034097524] [2024-11-23 02:10:16,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:10:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:16,601 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-23 02:10:16,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:16,810 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-23 02:10:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:10:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034097524] [2024-11-23 02:10:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034097524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:10:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111839432] [2024-11-23 02:10:16,811 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:10:16,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:10:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:16,813 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-23 02:10:16,814 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-23 02:10:16,975 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-23 02:10:16,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:10:16,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 02:10:16,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:17,082 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-23 02:10:17,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:10:17,323 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-23 02:10:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111839432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:10:17,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:10:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2024-11-23 02:10:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287189070] [2024-11-23 02:10:17,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:10:17,324 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:10:17,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 12 times [2024-11-23 02:10:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:17,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033381642] [2024-11-23 02:10:17,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:10:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:17,330 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:10:17,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:17,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:10:17,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-23 02:10:17,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-11-23 02:10:17,411 INFO L87 Difference]: Start difference. First operand 217 states and 243 transitions. cyclomatic complexity: 39 Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:10:17,621 INFO L93 Difference]: Finished difference Result 298 states and 332 transitions. [2024-11-23 02:10:17,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 332 transitions. [2024-11-23 02:10:17,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-23 02:10:17,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 266 states and 299 transitions. [2024-11-23 02:10:17,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2024-11-23 02:10:17,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-11-23 02:10:17,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 299 transitions. [2024-11-23 02:10:17,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:10:17,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 266 states and 299 transitions. [2024-11-23 02:10:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 299 transitions. [2024-11-23 02:10:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 196. [2024-11-23 02:10:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 195 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2024-11-23 02:10:17,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 220 transitions. [2024-11-23 02:10:17,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 02:10:17,627 INFO L425 stractBuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2024-11-23 02:10:17,627 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-23 02:10:17,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 220 transitions. [2024-11-23 02:10:17,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-23 02:10:17,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:10:17,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:10:17,628 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-23 02:10:17,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:10:17,628 INFO L745 eck$LassoCheckResult]: Stem: 10697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10656#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; 10657#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; 10642#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; 10643#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 10644#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; 10646#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 10647#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; 10724#L544-2 main_#t~post22#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 10723#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 10722#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; 10721#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; 10720#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; 10719#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 10718#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; 10717#L552-2 main_#t~post26#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post26#1;havoc main_#t~post26#1; 10715#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 10714#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; 10712#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 10713#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10707#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; 10708#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; 10709#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10710#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; 10672#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; 10673#L510-4 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10694#L510-1 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 10695#L510-5 strlen_#res#1 := strlen_~i~0#1; 10686#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; 10676#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 10665#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10666#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; 10834#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; 10835#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10836#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; 10837#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; 10667#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10668#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; 10671#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; 10693#L510-10 call strlen_#t~mem2#1 := read~int#0(strlen_~s#1.base, strlen_~s#1.offset, 1); 10669#L510-7 assume !(0 != strlen_#t~mem2#1);havoc strlen_#t~mem2#1; 10670#L510-11 strlen_#res#1 := strlen_~i~0#1; 10678#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; 10664#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 10658#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); 10659#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; 10702#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; 10829#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10703#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); 10704#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; 10827#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10788#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); 10737#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 10729#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; 10727#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; 10725#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; 10711#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; 10687#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; 10680#L518-3 [2024-11-23 02:10:17,628 INFO L747 eck$LassoCheckResult]: Loop: 10680#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 10698#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); 10679#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; 10680#L518-3 [2024-11-23 02:10:17,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash 259249140, now seen corresponding path program 7 times [2024-11-23 02:10:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748825455] [2024-11-23 02:10:17,629 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:10:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:17,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 13 times [2024-11-23 02:10:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:17,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000689669] [2024-11-23 02:10:17,703 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:10:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:17,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 940040927, now seen corresponding path program 8 times [2024-11-23 02:10:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:10:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777744377] [2024-11-23 02:10:17,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:10:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:10:17,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:10:17,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:10:17,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:10:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:10:17,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:10:27,038 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 554 DAG size of output: 396 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-23 02:10:27,706 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:10:27,706 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:10:27,706 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:10:27,706 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:10:27,706 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:10:27,706 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:27,706 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:10:27,706 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:10:27,706 INFO L132 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration25_Lasso [2024-11-23 02:10:27,706 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:10:27,706 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:10:27,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:27,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:28,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:10:29,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:10:29,393 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:10:29,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,396 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-23 02:10:29,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-23 02:10:29,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,418 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-11-23 02:10:29,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,438 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-23 02:10:29,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-11-23 02:10:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,457 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-23 02:10:29,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-23 02:10:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,477 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-11-23 02:10:29,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,495 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-11-23 02:10:29,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-11-23 02:10:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,515 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-11-23 02:10:29,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:29,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:29,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,538 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-11-23 02:10:29,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,557 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-11-23 02:10:29,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:29,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:29,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-11-23 02:10:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,578 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-11-23 02:10:29,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-11-23 02:10:29,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,598 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-11-23 02:10:29,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-11-23 02:10:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,617 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-11-23 02:10:29,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,636 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-11-23 02:10:29,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-11-23 02:10:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,656 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-23 02:10:29,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-11-23 02:10:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,675 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-23 02:10:29,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-11-23 02:10:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,695 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-23 02:10:29,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,715 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-23 02:10:29,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,735 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-11-23 02:10:29,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,755 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-11-23 02:10:29,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,774 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-11-23 02:10:29,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,792 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-11-23 02:10:29,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,811 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-11-23 02:10:29,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,831 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-11-23 02:10:29,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,850 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-11-23 02:10:29,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,870 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-11-23 02:10:29,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2024-11-23 02:10:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,889 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-11-23 02:10:29,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2024-11-23 02:10:29,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,908 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-11-23 02:10:29,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:10:29,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:10:29,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:10:29,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:10:29,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2024-11-23 02:10:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,926 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-11-23 02:10:29,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:10:29,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:10:29,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:10:29,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:10:29,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:10:29,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:10:29,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:10:29,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:10:29,957 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-23 02:10:29,957 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-23 02:10:29,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:10:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:10:29,959 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:10:29,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-11-23 02:10:29,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:10:29,970 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:10:29,970 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:10:29,970 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_8, ULTIMATE.start_memcmp_~d~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_8 - 1*ULTIMATE.start_memcmp_~d~0#1.offset Supporting invariants [] [2024-11-23 02:10:29,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:30,069 INFO L156 tatePredicateManager]: 37 out of 39 supporting invariants were superfluous and have been removed [2024-11-23 02:10:30,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~d~0!offset [2024-11-23 02:10:30,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:10:30,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:10:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,302 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-23 02:10:30,302 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-23 02:10:30,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37 Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 207 states and 233 transitions. Complement of second has 9 states. [2024-11-23 02:10:30,337 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-23 02:10:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2024-11-23 02:10:30,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 58 letters. Loop has 3 letters. [2024-11-23 02:10:30,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:30,337 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:10:30,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,548 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-23 02:10:30,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-23 02:10:30,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37 Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 207 states and 233 transitions. Complement of second has 9 states. [2024-11-23 02:10:30,586 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-23 02:10:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2024-11-23 02:10:30,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 58 letters. Loop has 3 letters. [2024-11-23 02:10:30,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:30,586 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:10:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:10:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:10:30,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:10:30,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:10:30,814 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-23 02:10:30,815 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-23 02:10:30,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37 Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 220 transitions. cyclomatic complexity: 37. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 213 states and 241 transitions. Complement of second has 8 states. [2024-11-23 02:10:30,858 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-23 02:10:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:10:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2024-11-23 02:10:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 58 letters. Loop has 3 letters. [2024-11-23 02:10:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 61 letters. Loop has 3 letters. [2024-11-23 02:10:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 58 letters. Loop has 6 letters. [2024-11-23 02:10:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:10:30,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 241 transitions. [2024-11-23 02:10:30,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:10:30,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:10:30,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:10:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:10:30,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-23 02:10:30,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:10:30,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:10:30,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:10:30,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:10:30 BoogieIcfgContainer [2024-11-23 02:10:30,866 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:10:30,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:10:30,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:10:30,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:10:30,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:09:42" (3/4) ... [2024-11-23 02:10:30,869 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:10:30,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:10:30,870 INFO L158 Benchmark]: Toolchain (without parser) took 49173.20ms. Allocated memory was 197.1MB in the beginning and 725.6MB in the end (delta: 528.5MB). Free memory was 166.6MB in the beginning and 550.8MB in the end (delta: -384.2MB). Peak memory consumption was 145.4MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,870 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:10:30,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.36ms. Allocated memory is still 197.1MB. Free memory was 166.6MB in the beginning and 146.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.23ms. Allocated memory is still 197.1MB. Free memory was 146.1MB in the beginning and 144.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,873 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 197.1MB. Free memory was 144.1MB in the beginning and 140.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,873 INFO L158 Benchmark]: RCFGBuilder took 354.80ms. Allocated memory is still 197.1MB. Free memory was 140.7MB in the beginning and 122.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,873 INFO L158 Benchmark]: BuchiAutomizer took 48410.98ms. Allocated memory was 197.1MB in the beginning and 725.6MB in the end (delta: 528.5MB). Free memory was 121.8MB in the beginning and 551.9MB in the end (delta: -430.1MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,873 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 725.6MB. Free memory was 551.9MB in the beginning and 550.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:10:30,874 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.36ms. Allocated memory is still 197.1MB. Free memory was 166.6MB in the beginning and 146.1MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.23ms. Allocated memory is still 197.1MB. Free memory was 146.1MB in the beginning and 144.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 197.1MB. Free memory was 144.1MB in the beginning and 140.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 354.80ms. Allocated memory is still 197.1MB. Free memory was 140.7MB in the beginning and 122.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 48410.98ms. Allocated memory was 197.1MB in the beginning and 725.6MB in the end (delta: 528.5MB). Free memory was 121.8MB in the beginning and 551.9MB in the end (delta: -430.1MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 725.6MB. Free memory was 551.9MB in the beginning and 550.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~haystack!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~d~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~haystack!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~d~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (17 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long) -1 * i) + out_len) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 11 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 17 modules have a trivial ranking function, the largest among these consists of 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.3s and 26 iterations. TraceHistogramMax:5. Analysis of lassos took 40.3s. Construction of modules took 2.6s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 20. Automata minimization 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 728 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1654 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1652 mSDsluCounter, 7191 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 151 IncrementalHoareTripleChecker+Unchecked, 6329 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6834 IncrementalHoareTripleChecker+Invalid, 7257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 862 mSDtfsCounter, 6834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU15 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax100 hnf100 lsp94 ukn74 mio100 lsp33 div167 bol100 ite100 ukn100 eq162 hnf92 smp81 dnf181 smp93 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:10:30,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:31,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Ended with exit code 0 [2024-11-23 02:10:31,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:31,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:31,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Ended with exit code 0 [2024-11-23 02:10:31,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:32,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:32,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Ended with exit code 0 [2024-11-23 02:10:32,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Forceful destruction successful, exit code 0 [2024-11-23 02:10:32,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2024-11-23 02:10:32,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE