./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:02:29,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:02:29,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:02:29,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:02:29,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:02:29,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:02:30,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:02:30,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:02:30,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:02:30,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:02:30,009 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:02:30,009 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:02:30,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:02:30,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:02:30,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:02:30,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:02:30,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:02:30,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:02:30,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:02:30,011 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:02:30,011 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 [2025-03-17 20:02:30,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:02:30,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:02:30,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:02:30,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:02:30,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:02:30,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-03-17 20:02:31,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa059a71/f4220ef1ddf94620970d630b01bf5e00/FLAGfbeff35ce [2025-03-17 20:02:31,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:02:31,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-03-17 20:02:31,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa059a71/f4220ef1ddf94620970d630b01bf5e00/FLAGfbeff35ce [2025-03-17 20:02:31,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa059a71/f4220ef1ddf94620970d630b01bf5e00 [2025-03-17 20:02:31,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:02:31,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:02:31,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:31,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:02:31,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:02:31,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:02:31" (1/1) ... [2025-03-17 20:02:31,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:31, skipping insertion in model container [2025-03-17 20:02:31,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:02:31" (1/1) ... [2025-03-17 20:02:31,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:02:31,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:31,973 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:02:32,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:32,030 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:02:32,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32 WrapperNode [2025-03-17 20:02:32,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:32,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:32,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:02:32,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:02:32,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,061 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-03-17 20:02:32,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:32,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:02:32,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:02:32,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:02:32,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,084 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-17 20:02:32,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:02:32,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:02:32,093 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:02:32,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:02:32,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (1/1) ... [2025-03-17 20:02:32,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,117 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) [2025-03-17 20:02:32,121 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 [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:02:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:02:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:02:32,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:02:32,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:02:32,324 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L534: call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-17 20:02:32,334 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-17 20:02:32,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:02:32,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:02:32,340 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:02:32,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:32 BoogieIcfgContainer [2025-03-17 20:02:32,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:02:32,341 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:02:32,341 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:02:32,344 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:02:32,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,345 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:02:31" (1/3) ... [2025-03-17 20:02:32,345 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4668b5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:02:32, skipping insertion in model container [2025-03-17 20:02:32,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,346 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:02:32" (2/3) ... [2025-03-17 20:02:32,346 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4668b5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:02:32, skipping insertion in model container [2025-03-17 20:02:32,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,346 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:32" (3/3) ... [2025-03-17 20:02:32,348 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2025-03-17 20:02:32,381 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:02:32,381 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:02:32,381 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:02:32,381 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:02:32,381 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:02:32,381 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:02:32,382 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:02:32,382 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:02:32,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:32,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-17 20:02:32,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:32,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:32,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:02:32,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:32,401 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:02:32,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:32,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-03-17 20:02:32,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:32,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:32,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:02:32,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:32,406 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" [2025-03-17 20:02:32,406 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-03-17 20:02:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1784414, now seen corresponding path program 1 times [2025-03-17 20:02:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528559076] [2025-03-17 20:02:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:32,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:32,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:32,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:32,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2025-03-17 20:02:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483218784] [2025-03-17 20:02:32,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:32,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:32,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:32,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:32,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 55316856, now seen corresponding path program 1 times [2025-03-17 20:02:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893068041] [2025-03-17 20:02:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:32,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:32,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,870 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:32,870 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:32,871 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:32,871 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:32,871 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:32,871 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,871 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:32,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:32,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration1_Lasso [2025-03-17 20:02:32,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:32,872 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:32,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:32,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:33,378 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,382 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) [2025-03-17 20:02:33,384 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 [2025-03-17 20:02:33,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,411 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) [2025-03-17 20:02:33,412 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 [2025-03-17 20:02:33,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,432 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 [2025-03-17 20:02:33,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,434 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) [2025-03-17 20:02:33,436 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 [2025-03-17 20:02:33,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,456 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 [2025-03-17 20:02:33,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,459 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) [2025-03-17 20:02:33,461 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 [2025-03-17 20:02:33,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 [2025-03-17 20:02:33,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:02:33,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,482 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) [2025-03-17 20:02:33,483 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 [2025-03-17 20:02:33,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,503 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 [2025-03-17 20:02:33,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,505 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) [2025-03-17 20:02:33,507 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 [2025-03-17 20:02:33,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,530 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 [2025-03-17 20:02:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,533 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) [2025-03-17 20:02:33,533 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 [2025-03-17 20:02:33,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 [2025-03-17 20:02:33,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,556 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) [2025-03-17 20:02:33,558 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 [2025-03-17 20:02:33,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 [2025-03-17 20:02:33,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,580 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) [2025-03-17 20:02:33,582 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 [2025-03-17 20:02:33,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,606 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 [2025-03-17 20:02:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,608 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) [2025-03-17 20:02:33,609 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 [2025-03-17 20:02:33,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,630 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 [2025-03-17 20:02:33,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,632 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) [2025-03-17 20:02:33,633 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 [2025-03-17 20:02:33,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,660 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 [2025-03-17 20:02:33,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,663 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) [2025-03-17 20:02:33,665 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 [2025-03-17 20:02:33,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:33,715 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:02:33,717 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-17 20:02:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,721 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) [2025-03-17 20:02:33,722 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 [2025-03-17 20:02:33,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:33,736 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:33,737 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:33,737 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length1~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length1~0#1 Supporting invariants [] [2025-03-17 20:02:33,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,757 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:02:33,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:33,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:33,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:33,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:33,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:02:33,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2025-03-17 20:02:33,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 18 states and 28 transitions. Complement of second has 3 states. [2025-03-17 20:02:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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) [2025-03-17 20:02:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-03-17 20:02:33,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 20:02:33,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-17 20:02:33,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 20:02:33,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 28 transitions. [2025-03-17 20:02:33,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:33,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 21 transitions. [2025-03-17 20:02:33,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:02:33,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 20:02:33,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. [2025-03-17 20:02:33,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:33,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-03-17 20:02:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. [2025-03-17 20:02:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-17 20:02:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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) [2025-03-17 20:02:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2025-03-17 20:02:33,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-17 20:02:33,909 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-03-17 20:02:33,909 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:02:33,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2025-03-17 20:02:33,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:33,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:33,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:33,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:33,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:33,910 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" [2025-03-17 20:02:33,910 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-03-17 20:02:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 55316855, now seen corresponding path program 1 times [2025-03-17 20:02:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824242697] [2025-03-17 20:02:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:33,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:33,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:33,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824242697] [2025-03-17 20:02:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824242697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:02:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499794235] [2025-03-17 20:02:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:33,988 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:33,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2025-03-17 20:02:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:33,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342406315] [2025-03-17 20:02:33,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:33,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:33,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:33,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:33,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:33,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:33,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:33,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:34,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:02:34,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:02:34,033 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2025-03-17 20:02:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:34,048 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2025-03-17 20:02:34,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-17 20:02:34,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:34,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-03-17 20:02:34,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:02:34,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:02:34,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-17 20:02:34,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:34,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 20:02:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-17 20:02:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-17 20:02:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-17 20:02:34,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 20:02:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:02:34,051 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 20:02:34,051 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:02:34,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-17 20:02:34,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-17 20:02:34,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:34,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:34,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:02:34,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:34,051 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" [2025-03-17 20:02:34,051 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-03-17 20:02:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1714822557, now seen corresponding path program 1 times [2025-03-17 20:02:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462903555] [2025-03-17 20:02:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:34,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:34,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:34,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:34,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2025-03-17 20:02:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242720759] [2025-03-17 20:02:34,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:34,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:34,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:34,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891735, now seen corresponding path program 1 times [2025-03-17 20:02:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476492036] [2025-03-17 20:02:34,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:34,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:02:34,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:34,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:02:34,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,365 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:34,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:34,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:34,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:34,365 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:34,365 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:34,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:34,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration3_Lasso [2025-03-17 20:02:34,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:34,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:34,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:34,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,876 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:34,876 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:34,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,893 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) [2025-03-17 20:02:34,914 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 [2025-03-17 20:02:34,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:34,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 20:02:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,967 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) [2025-03-17 20:02:34,968 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 [2025-03-17 20:02:34,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:34,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,986 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 [2025-03-17 20:02:34,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,991 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) [2025-03-17 20:02:34,995 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 [2025-03-17 20:02:34,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 [2025-03-17 20:02:35,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,037 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) [2025-03-17 20:02:35,039 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 [2025-03-17 20:02:35,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:35,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:35,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,074 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) [2025-03-17 20:02:35,076 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 [2025-03-17 20:02:35,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:35,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,101 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 [2025-03-17 20:02:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,104 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) [2025-03-17 20:02:35,104 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 [2025-03-17 20:02:35,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:35,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:35,152 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:35,152 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-17 20:02:35,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,154 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) [2025-03-17 20:02:35,158 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 [2025-03-17 20:02:35,159 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:35,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:35,170 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:35,170 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2025-03-17 20:02:35,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:35,186 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:02:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 20:02:35,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:35,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:02:35,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:35,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:02:35,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,224 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 14 states and 20 transitions. Complement of second has 3 states. [2025-03-17 20:02:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2025-03-17 20:02:35,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-17 20:02:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2025-03-17 20:02:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 20:02:35,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2025-03-17 20:02:35,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:35,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 20 transitions. [2025-03-17 20:02:35,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:02:35,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 20:02:35,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-17 20:02:35,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:35,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-17 20:02:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-17 20:02:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 20:02:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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) [2025-03-17 20:02:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-17 20:02:35,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 20:02:35,227 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-17 20:02:35,227 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:02:35,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-17 20:02:35,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:35,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:35,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:35,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:35,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:35,228 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" [2025-03-17 20:02:35,228 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" [2025-03-17 20:02:35,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891734, now seen corresponding path program 1 times [2025-03-17 20:02:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-03-17 20:02:35,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:35,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:02:35,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:35,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:35,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-03-17 20:02:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269694619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:35,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:35,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:02:35,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842631598] [2025-03-17 20:02:35,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:35,300 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:35,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1445695, now seen corresponding path program 1 times [2025-03-17 20:02:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472875441] [2025-03-17 20:02:35,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:35,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:35,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:35,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:35,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:02:35,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:02:35,408 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:35,423 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2025-03-17 20:02:35,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-03-17 20:02:35,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:35,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2025-03-17 20:02:35,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:02:35,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:02:35,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-17 20:02:35,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:35,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-17 20:02:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-17 20:02:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 20:02:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-17 20:02:35,424 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-17 20:02:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:02:35,426 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-17 20:02:35,426 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:02:35,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-17 20:02:35,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:35,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:35,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:35,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:35,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:35,427 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" [2025-03-17 20:02:35,427 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" [2025-03-17 20:02:35,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1322963748, now seen corresponding path program 1 times [2025-03-17 20:02:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-03-17 20:02:35,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:35,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:35,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:35,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:35,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 20:02:35,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1445695, now seen corresponding path program 2 times [2025-03-17 20:02:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372659404] [2025-03-17 20:02:35,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:35,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:35,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:35,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:35,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:35,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:35,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash 248731290, now seen corresponding path program 1 times [2025-03-17 20:02:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722430905] [2025-03-17 20:02:35,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:35,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:35,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:02:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722430905] [2025-03-17 20:02:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722430905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302456934] [2025-03-17 20:02:35,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,764 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:35,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 20:02:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:35,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:35,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,869 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 [2025-03-17 20:02:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:35,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:35,892 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 13 treesize of output 11 [2025-03-17 20:02:35,894 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 14 treesize of output 12 [2025-03-17 20:02:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302456934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:35,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-17 20:02:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227912689] [2025-03-17 20:02:35,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:36,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 20:02:36,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 20:02:36,005 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:36,091 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2025-03-17 20:02:36,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2025-03-17 20:02:36,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:36,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 18 transitions. [2025-03-17 20:02:36,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 20:02:36,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:02:36,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-17 20:02:36,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:36,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:02:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-17 20:02:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 20:02:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-17 20:02:36,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:02:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:36,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 20:02:36,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:02:36,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2025-03-17 20:02:36,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 20:02:36,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:36,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:36,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:36,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:36,094 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" [2025-03-17 20:02:36,094 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" [2025-03-17 20:02:36,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1937827574, now seen corresponding path program 2 times [2025-03-17 20:02:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723098854] [2025-03-17 20:02:36,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-17 20:02:36,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:36,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:36,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1445695, now seen corresponding path program 3 times [2025-03-17 20:02:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-03-17 20:02:36,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:36,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:36,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:36,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1781560244, now seen corresponding path program 2 times [2025-03-17 20:02:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-03-17 20:02:36,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 20:02:36,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:36,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:36,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,922 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:36,922 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:36,922 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:36,922 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:36,922 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:36,922 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:36,922 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:36,922 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:36,922 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration6_Lasso [2025-03-17 20:02:36,922 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:36,922 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:36,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:36,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:37,492 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,494 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) [2025-03-17 20:02:37,496 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 [2025-03-17 20:02:37,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,517 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 [2025-03-17 20:02:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,520 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) [2025-03-17 20:02:37,522 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 [2025-03-17 20:02:37,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 20:02:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,544 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) [2025-03-17 20:02:37,548 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 [2025-03-17 20:02:37,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:02:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,572 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) [2025-03-17 20:02:37,573 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 [2025-03-17 20:02:37,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:02:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,597 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) [2025-03-17 20:02:37,597 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 [2025-03-17 20:02:37,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,615 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 [2025-03-17 20:02:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,617 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) [2025-03-17 20:02:37,618 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 [2025-03-17 20:02:37,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 [2025-03-17 20:02:37,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,635 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 [2025-03-17 20:02:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,637 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) [2025-03-17 20:02:37,639 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 [2025-03-17 20:02:37,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 [2025-03-17 20:02:37,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:37,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:37,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,661 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 [2025-03-17 20:02:37,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,664 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) [2025-03-17 20:02:37,665 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 [2025-03-17 20:02:37,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,684 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 [2025-03-17 20:02:37,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,686 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) [2025-03-17 20:02:37,687 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 [2025-03-17 20:02:37,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 [2025-03-17 20:02:37,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,705 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 [2025-03-17 20:02:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,707 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) [2025-03-17 20:02:37,708 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 [2025-03-17 20:02:37,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 20:02:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,728 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) [2025-03-17 20:02:37,730 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 [2025-03-17 20:02:37,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,748 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 [2025-03-17 20:02:37,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,750 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) [2025-03-17 20:02:37,750 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 [2025-03-17 20:02:37,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,769 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 [2025-03-17 20:02:37,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,771 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) [2025-03-17 20:02:37,772 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 [2025-03-17 20:02:37,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,791 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 [2025-03-17 20:02:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,793 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) [2025-03-17 20:02:37,795 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 [2025-03-17 20:02:37,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,813 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 [2025-03-17 20:02:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,816 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) [2025-03-17 20:02:37,818 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 [2025-03-17 20:02:37,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:37,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,839 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) [2025-03-17 20:02:37,841 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 [2025-03-17 20:02:37,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,859 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 [2025-03-17 20:02:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,861 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) [2025-03-17 20:02:37,863 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 [2025-03-17 20:02:37,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:37,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,883 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) [2025-03-17 20:02:37,884 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 [2025-03-17 20:02:37,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 20:02:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,906 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) [2025-03-17 20:02:37,906 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 [2025-03-17 20:02:37,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,924 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 [2025-03-17 20:02:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,926 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) [2025-03-17 20:02:37,927 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 [2025-03-17 20:02:37,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:37,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:37,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:37,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,946 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 [2025-03-17 20:02:37,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,948 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) [2025-03-17 20:02:37,949 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 [2025-03-17 20:02:37,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 [2025-03-17 20:02:37,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,966 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 [2025-03-17 20:02:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,968 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) [2025-03-17 20:02:37,969 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 [2025-03-17 20:02:37,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 [2025-03-17 20:02:37,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:37,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:37,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:37,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:37,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:37,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:37,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:37,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:37,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 20:02:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:37,988 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) [2025-03-17 20:02:37,989 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 [2025-03-17 20:02:37,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,013 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 [2025-03-17 20:02:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,015 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) [2025-03-17 20:02:38,015 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 [2025-03-17 20:02:38,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,040 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 [2025-03-17 20:02:38,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,042 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) [2025-03-17 20:02:38,043 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 [2025-03-17 20:02:38,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,065 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) [2025-03-17 20:02:38,066 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 [2025-03-17 20:02:38,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,086 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 [2025-03-17 20:02:38,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,087 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) [2025-03-17 20:02:38,088 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 [2025-03-17 20:02:38,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-17 20:02:38,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,109 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) [2025-03-17 20:02:38,110 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 [2025-03-17 20:02:38,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,131 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 [2025-03-17 20:02:38,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,133 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) [2025-03-17 20:02:38,135 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 [2025-03-17 20:02:38,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,155 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 [2025-03-17 20:02:38,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,157 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) [2025-03-17 20:02:38,163 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 [2025-03-17 20:02:38,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-17 20:02:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,186 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) [2025-03-17 20:02:38,187 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 [2025-03-17 20:02:38,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,198 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 20:02:38,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,204 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 20:02:38,204 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-17 20:02:38,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,221 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 [2025-03-17 20:02:38,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,224 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) [2025-03-17 20:02:38,225 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 [2025-03-17 20:02:38,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:38,258 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:38,259 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:02:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,261 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) [2025-03-17 20:02:38,262 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 [2025-03-17 20:02:38,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:38,273 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:38,273 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:38,274 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s1#1.base)_1, ULTIMATE.start_cstrpbrk_~s1#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s1#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1#1.offset Supporting invariants [] [2025-03-17 20:02:38,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,301 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-17 20:02:38,303 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2025-03-17 20:02:38,303 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:38,304 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:38,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:38,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:38,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:38,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:38,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:38,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:02:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:38,369 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 [2025-03-17 20:02:38,369 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:38,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 25 transitions. Complement of second has 4 states. [2025-03-17 20:02:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2025-03-17 20:02:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 20:02:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-17 20:02:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-17 20:02:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:38,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-03-17 20:02:38,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:38,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 24 transitions. [2025-03-17 20:02:38,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:02:38,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 20:02:38,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2025-03-17 20:02:38,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:38,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 20:02:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2025-03-17 20:02:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-17 20:02:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-17 20:02:38,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-17 20:02:38,386 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-17 20:02:38,388 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:02:38,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2025-03-17 20:02:38,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:38,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:38,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:38,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:38,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:38,389 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" [2025-03-17 20:02:38,389 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" [2025-03-17 20:02:38,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1763507307, now seen corresponding path program 1 times [2025-03-17 20:02:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:38,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-17 20:02:38,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:38,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:38,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:38,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:38,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:38,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:38,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:38,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 1 times [2025-03-17 20:02:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-03-17 20:02:38,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:38,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:38,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:38,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:38,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:38,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:38,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:38,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:38,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash -606207307, now seen corresponding path program 1 times [2025-03-17 20:02:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-03-17 20:02:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:38,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:38,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:38,544 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 [2025-03-17 20:02:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943625680] [2025-03-17 20:02:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943625680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260005951] [2025-03-17 20:02:38,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,673 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-03-17 20:02:38,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:38,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:38,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:38,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:38,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 20:02:38,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:38,857 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 [2025-03-17 20:02:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:38,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:38,881 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 13 treesize of output 11 [2025-03-17 20:02:38,884 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 14 treesize of output 12 [2025-03-17 20:02:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260005951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:38,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2025-03-17 20:02:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889480201] [2025-03-17 20:02:38,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:38,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 20:02:38,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 20:02:38,992 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:39,101 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2025-03-17 20:02:39,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2025-03-17 20:02:39,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:39,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 29 transitions. [2025-03-17 20:02:39,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 20:02:39,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 20:02:39,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2025-03-17 20:02:39,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:39,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-17 20:02:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2025-03-17 20:02:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-03-17 20:02:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-17 20:02:39,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 20:02:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:39,104 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 20:02:39,104 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:02:39,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-03-17 20:02:39,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:39,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:39,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:39,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:39,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:39,105 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" [2025-03-17 20:02:39,105 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" [2025-03-17 20:02:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1165880091, now seen corresponding path program 2 times [2025-03-17 20:02:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-17 20:02:39,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 20:02:39,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:39,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:39,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:39,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:39,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 2 times [2025-03-17 20:02:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-03-17 20:02:39,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:39,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:39,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:39,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -666720913, now seen corresponding path program 2 times [2025-03-17 20:02:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550827965] [2025-03-17 20:02:39,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 20:02:39,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:39,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:39,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:02:39,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:02:39,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:40,613 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:40,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:40,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:40,614 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:40,614 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:40,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:40,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:40,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:40,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration8_Lasso [2025-03-17 20:02:40,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:40,614 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:40,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:40,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:41,051 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:41,052 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:41,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,054 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) [2025-03-17 20:02:41,055 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 [2025-03-17 20:02:41,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:41,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:41,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:41,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:02:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,073 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) [2025-03-17 20:02:41,074 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 [2025-03-17 20:02:41,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:41,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:41,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:41,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 20:02:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,092 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) [2025-03-17 20:02:41,092 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 [2025-03-17 20:02:41,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:41,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:41,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,111 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 [2025-03-17 20:02:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,113 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) [2025-03-17 20:02:41,113 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 [2025-03-17 20:02:41,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:41,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:41,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:02:41,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,139 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) [2025-03-17 20:02:41,141 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 [2025-03-17 20:02:41,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,152 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:02:41,152 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-17 20:02:41,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,163 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-03-17 20:02:41,163 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-17 20:02:41,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,200 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 [2025-03-17 20:02:41,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,202 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) [2025-03-17 20:02:41,203 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 [2025-03-17 20:02:41,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:41,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:41,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:41,222 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 [2025-03-17 20:02:41,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,224 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) [2025-03-17 20:02:41,225 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 [2025-03-17 20:02:41,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:41,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:41,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:41,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:41,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:41,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:41,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:41,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:41,256 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-17 20:02:41,256 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:02:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,258 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) [2025-03-17 20:02:41,259 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 [2025-03-17 20:02:41,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:41,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:41,269 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:41,269 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_4, ULTIMATE.start_cstrpbrk_~scanp~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_4 - 1*ULTIMATE.start_cstrpbrk_~scanp~0#1.offset Supporting invariants [] [2025-03-17 20:02:41,275 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 [2025-03-17 20:02:41,288 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:02:41,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~scanp~0!offset [2025-03-17 20:02:41,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:41,290 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:41,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:41,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:41,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:41,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:41,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:41,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:41,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:41,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:02:41,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:41,410 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 [2025-03-17 20:02:41,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:41,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 36 states and 44 transitions. Complement of second has 7 states. [2025-03-17 20:02:41,445 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 [2025-03-17 20:02:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-03-17 20:02:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-17 20:02:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-17 20:02:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-17 20:02:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:41,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2025-03-17 20:02:41,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:41,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 33 transitions. [2025-03-17 20:02:41,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:02:41,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:02:41,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2025-03-17 20:02:41,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:41,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-17 20:02:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2025-03-17 20:02:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-03-17 20:02:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-17 20:02:41,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-17 20:02:41,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-17 20:02:41,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:02:41,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-03-17 20:02:41,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:41,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:41,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:41,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:41,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:41,452 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" [2025-03-17 20:02:41,452 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" [2025-03-17 20:02:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 806489433, now seen corresponding path program 3 times [2025-03-17 20:02:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703680746] [2025-03-17 20:02:41,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:41,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-17 20:02:41,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:41,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:02:41,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:41,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-17 20:02:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703680746] [2025-03-17 20:02:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703680746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806027808] [2025-03-17 20:02:41,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:41,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:41,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:41,750 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:41,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-03-17 20:02:41,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-17 20:02:41,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:41,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 20:02:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:41,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 20:02:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:41,878 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 [2025-03-17 20:02:41,975 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 20:02:41,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 20:02:41,978 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 17 treesize of output 10 [2025-03-17 20:02:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:41,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:42,023 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 [2025-03-17 20:02:42,026 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 24 treesize of output 20 [2025-03-17 20:02:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 20:02:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806027808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:42,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-17 20:02:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813859726] [2025-03-17 20:02:42,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:42,148 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 3 times [2025-03-17 20:02:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577324971] [2025-03-17 20:02:42,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:42,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:42,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:42,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:42,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 20:02:42,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-17 20:02:42,196 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 9 Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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) [2025-03-17 20:02:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:42,322 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-03-17 20:02:42,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2025-03-17 20:02:42,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:42,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 26 transitions. [2025-03-17 20:02:42,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 20:02:42,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 20:02:42,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2025-03-17 20:02:42,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:42,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 20:02:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2025-03-17 20:02:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 20:02:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-17 20:02:42,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 20:02:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:02:42,327 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 20:02:42,327 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:02:42,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-03-17 20:02:42,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:42,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:42,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:42,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:42,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:42,329 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" [2025-03-17 20:02:42,329 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" [2025-03-17 20:02:42,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,329 INFO L85 PathProgramCache]: Analyzing trace with hash 788991347, now seen corresponding path program 4 times [2025-03-17 20:02:42,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-03-17 20:02:42,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-17 20:02:42,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:42,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:42,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:42,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 4 times [2025-03-17 20:02:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-03-17 20:02:42,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-17 20:02:42,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,363 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:42,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:42,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1514781673, now seen corresponding path program 1 times [2025-03-17 20:02:42,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087333331] [2025-03-17 20:02:42,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:42,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:42,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:42,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 20:02:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087333331] [2025-03-17 20:02:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087333331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392552656] [2025-03-17 20:02:42,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:42,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:42,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,468 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:02:42,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-17 20:02:42,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:42,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:42,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:42,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 20:02:42,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:42,553 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 8 treesize of output 1 [2025-03-17 20:02:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 20:02:42,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 20:02:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392552656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:42,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-17 20:02:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174706743] [2025-03-17 20:02:42,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:42,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 20:02:42,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 20:02:42,629 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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) [2025-03-17 20:02:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:42,670 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-17 20:02:42,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2025-03-17 20:02:42,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:42,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 27 states and 32 transitions. [2025-03-17 20:02:42,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-17 20:02:42,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-17 20:02:42,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2025-03-17 20:02:42,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:42,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-17 20:02:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2025-03-17 20:02:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-17 20:02:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-17 20:02:42,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-17 20:02:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 20:02:42,677 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-17 20:02:42,677 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:02:42,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2025-03-17 20:02:42,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 20:02:42,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:42,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:42,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:42,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:42,678 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~0#1 < main_~length1~0#1);havoc main_~i~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1;main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" "assume !(main_~i~1#1 < main_~length2~0#1);havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume true;cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1;" "assume 0 != cstrpbrk_~c~0#1;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;" [2025-03-17 20:02:42,678 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1;" "assume 0 != cstrpbrk_~sc~0#1;havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1;" "assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1);" [2025-03-17 20:02:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1551872173, now seen corresponding path program 2 times [2025-03-17 20:02:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-03-17 20:02:42,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 20:02:42,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:42,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 5 times [2025-03-17 20:02:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-03-17 20:02:42,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:42,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:42,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:42,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash -795920841, now seen corresponding path program 3 times [2025-03-17 20:02:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:42,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-03-17 20:02:42,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:42,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-17 20:02:42,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:42,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:42,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:02:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:02:42,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:42,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:42,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:46,065 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:46,065 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:46,065 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:46,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:46,065 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:46,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:46,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:46,065 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration11_Lasso [2025-03-17 20:02:46,066 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:46,066 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:46,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:46,631 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:46,631 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,634 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) [2025-03-17 20:02:46,635 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 [2025-03-17 20:02: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 [2025-03-17 20:02:46,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,653 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 [2025-03-17 20:02:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,655 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) [2025-03-17 20:02:46,655 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 [2025-03-17 20:02: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 [2025-03-17 20:02:46,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:02:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,675 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) [2025-03-17 20:02:46,676 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 [2025-03-17 20:02: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 [2025-03-17 20:02:46,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,693 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 [2025-03-17 20:02:46,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,694 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) [2025-03-17 20:02:46,695 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 [2025-03-17 20:02:46,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,711 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 [2025-03-17 20:02:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,713 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) [2025-03-17 20:02:46,714 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 [2025-03-17 20:02:46,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:46,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:46,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-17 20:02:46,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,734 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) [2025-03-17 20:02:46,738 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 [2025-03-17 20:02:46,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 [2025-03-17 20:02:46,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 20:02:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,757 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) [2025-03-17 20:02:46,757 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 [2025-03-17 20:02:46,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 20:02:46,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,776 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) [2025-03-17 20:02:46,777 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 [2025-03-17 20:02:46,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:46,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,796 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) [2025-03-17 20:02:46,797 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 [2025-03-17 20:02:46,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,814 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 [2025-03-17 20:02:46,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,816 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) [2025-03-17 20:02:46,817 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 [2025-03-17 20:02:46,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,833 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 [2025-03-17 20:02:46,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,835 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) [2025-03-17 20:02:46,836 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 [2025-03-17 20:02:46,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,853 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 [2025-03-17 20:02:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,855 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) [2025-03-17 20:02:46,855 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 [2025-03-17 20:02:46,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,872 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 [2025-03-17 20:02:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,874 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) [2025-03-17 20:02:46,874 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 [2025-03-17 20:02:46,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,892 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 [2025-03-17 20:02:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,894 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) [2025-03-17 20:02:46,894 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 [2025-03-17 20:02:46,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,911 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 [2025-03-17 20:02:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,912 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) [2025-03-17 20:02:46,913 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 [2025-03-17 20:02:46,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 20:02:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,931 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) [2025-03-17 20:02:46,932 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 [2025-03-17 20:02:46,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 20:02:46,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,949 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) [2025-03-17 20:02:46,950 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 [2025-03-17 20:02:46,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,967 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 [2025-03-17 20:02:46,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,969 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) [2025-03-17 20:02:46,970 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 [2025-03-17 20:02:46,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:46,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:46,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:46,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:46,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:46,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:46,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:46,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:46,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:46,988 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 [2025-03-17 20:02:46,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:46,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:46,990 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) [2025-03-17 20:02:46,991 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 [2025-03-17 20:02:46,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:47,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:47,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:47,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,011 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 [2025-03-17 20:02:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,013 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) [2025-03-17 20:02:47,014 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 [2025-03-17 20:02:47,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:47,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:47,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:47,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,065 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 [2025-03-17 20:02:47,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,067 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) [2025-03-17 20:02:47,068 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 [2025-03-17 20:02:47,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:47,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,091 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) [2025-03-17 20:02:47,091 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 [2025-03-17 20:02:47,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:47,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,110 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 [2025-03-17 20:02:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,147 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) [2025-03-17 20:02:47,148 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 [2025-03-17 20:02:47,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,158 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2025-03-17 20:02:47,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,160 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-17 20:02:47,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,178 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 [2025-03-17 20:02:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,180 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) [2025-03-17 20:02:47,181 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 [2025-03-17 20:02:47,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:47,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,205 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 [2025-03-17 20:02:47,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,207 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) [2025-03-17 20:02:47,208 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 [2025-03-17 20:02:47,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:47,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,226 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 [2025-03-17 20:02:47,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,228 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) [2025-03-17 20:02:47,228 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 [2025-03-17 20:02:47,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,238 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:02:47,238 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-17 20:02:47,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,247 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-03-17 20:02:47,247 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-17 20:02:47,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:47,285 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 [2025-03-17 20:02:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,287 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) [2025-03-17 20:02:47,288 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 [2025-03-17 20:02:47,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:47,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:47,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:47,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:47,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:47,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:47,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:47,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:47,321 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:02:47,322 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:02:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:47,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:47,324 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) [2025-03-17 20:02:47,325 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 [2025-03-17 20:02:47,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:47,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:47,337 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:47,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~scanp~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~scanp~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_2 Supporting invariants [] [2025-03-17 20:02:47,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:47,373 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2025-03-17 20:02:47,376 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~scanp~0!offset [2025-03-17 20:02:47,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:47,377 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:47,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:47,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:47,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:47,520 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 [2025-03-17 20:02:47,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 34 states and 42 transitions. Complement of second has 7 states. [2025-03-17 20:02:47,550 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 [2025-03-17 20:02:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-03-17 20:02:47,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 20 letters. Loop has 3 letters. [2025-03-17 20:02:47,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,550 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:47,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:47,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:47,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:47,686 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 [2025-03-17 20:02:47,686 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 7 states. [2025-03-17 20:02:47,725 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 [2025-03-17 20:02:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2025-03-17 20:02:47,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2025-03-17 20:02:47,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,726 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:02:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 20:02:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 20:02:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:47,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:47,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:47,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:47,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 20:02:47,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:02:47,862 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 [2025-03-17 20:02:47,862 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 30 states and 36 transitions. Complement of second has 6 states. [2025-03-17 20:02:47,889 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 [2025-03-17 20:02:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-03-17 20:02:47,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 20 letters. Loop has 3 letters. [2025-03-17 20:02:47,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 3 letters. [2025-03-17 20:02:47,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 20 letters. Loop has 6 letters. [2025-03-17 20:02:47,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:47,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2025-03-17 20:02:47,891 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:02:47,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:02:47,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:02:47,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:47,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:02:47,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:02:47,891 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:02:47,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:02:47,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:02:47 BoogieIcfgContainer [2025-03-17 20:02:47,896 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:02:47,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:02:47,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:02:47,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:02:47,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:02:32" (3/4) ... [2025-03-17 20:02:47,899 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:02:47,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:02:47,900 INFO L158 Benchmark]: Toolchain (without parser) took 16172.06ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.3MB in the beginning and 97.8MB in the end (delta: 56.5MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2025-03-17 20:02:47,900 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:47,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.12ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 137.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:02:47,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 136.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:47,900 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:47,901 INFO L158 Benchmark]: IcfgBuilder took 250.02ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 120.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:02:47,901 INFO L158 Benchmark]: BuchiAutomizer took 15555.51ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 120.7MB in the beginning and 97.9MB in the end (delta: 22.9MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-03-17 20:02:47,901 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 243.3MB. Free memory was 97.9MB in the beginning and 97.8MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:02:47,902 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.12ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 137.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 136.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 250.02ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 120.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 15555.51ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 120.7MB in the beginning and 97.9MB in the end (delta: 22.9MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 243.3MB. Free memory was 97.9MB in the beginning and 97.8MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s1!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: ~scanp~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: ~scanp~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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 2 locations. One deterministic module has affine ranking function (length2 + ((long long) -1 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 14.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 144 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax111 hnf100 lsp88 ukn71 mio100 lsp34 div132 bol100 ite100 ukn100 eq170 hnf90 smp88 dnf112 smp94 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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! [2025-03-17 20:02:47,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:48,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-03-17 20:02:48,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:48,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-03-17 20:02:48,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:48,919 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