./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-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_cstrstr-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 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:02:30,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:02:30,224 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:30,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:02:30,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:02:30,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:02:30,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:02:30,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:02:30,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:02:30,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:02:30,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:02:30,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:02:30,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:02:30,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:02:30,251 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:02:30,251 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:02:30,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:02:30,252 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:02:30,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:02:30,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:02:30,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:02:30,253 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:02:30,253 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 -> 991fb09b573d5827d0db553f1ea89a581f5a664ba8b68d6f14a043df738f2f6d [2025-03-17 20:02:30,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:02:30,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:02:30,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:02:30,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:02:30,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:02:30,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2025-03-17 20:02:31,584 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37d9ef7b/f7d93b510c334450b991380712e1d2b9/FLAG6992f528a [2025-03-17 20:02:31,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:02:31,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2025-03-17 20:02:31,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37d9ef7b/f7d93b510c334450b991380712e1d2b9/FLAG6992f528a [2025-03-17 20:02:31,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37d9ef7b/f7d93b510c334450b991380712e1d2b9 [2025-03-17 20:02:31,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:02:31,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:02:31,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:31,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:02:31,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:02:31,843 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,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d91769 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,844 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,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:02:32,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:32,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:02:32,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:02:32,082 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:02:32,083 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,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:02:32,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:32,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:02:32,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:02:32,088 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,094 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,110 INFO L138 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-03-17 20:02:32,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:02:32,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:02:32,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:02:32,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:02:32,118 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,118 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,122 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,135 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [6, 6]. 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,135 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,135 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,141 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,142 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,143 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,143 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,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:02:32,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:02:32,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:02:32,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:02:32,146 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,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:32,168 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,171 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,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:02:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:02:32,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:02:32,265 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:02:32,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:02:32,458 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_#t~ret28#1.base, main_#t~ret28#1.offset;call ULTIMATE.dealloc(main_#t~malloc22#1.base, main_#t~malloc22#1.offset);havoc main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call ULTIMATE.dealloc(main_#t~malloc23#1.base, main_#t~malloc23#1.offset);havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset; [2025-03-17 20:02:32,477 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-17 20:02:32,478 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:02:32,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:02:32,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:02:32,486 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,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:02:32,487 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:02:32,487 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:02:32,491 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:02:32,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,492 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,493 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14ce5c33 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,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,494 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,494 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14ce5c33 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,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:02:32,494 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,496 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2025-03-17 20:02:32,534 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:02:32,534 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:02:32,534 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:02:32,534 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:02:32,535 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:02:32,535 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:02:32,535 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:02:32,535 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:02:32,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-03-17 20:02:32,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:32,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:32,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:02:32,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:32,557 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:02:32,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-03-17 20:02:32,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:32,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:32,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:02:32,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:32,563 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" [2025-03-17 20:02:32,563 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" [2025-03-17 20:02:32,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2615582, now seen corresponding path program 1 times [2025-03-17 20:02:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560582709] [2025-03-17 20:02:32,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:32,634 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,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:32,642 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,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 80, now seen corresponding path program 1 times [2025-03-17 20:02:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625501721] [2025-03-17 20:02:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:32,665 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,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:32,674 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,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:32,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 81083091, now seen corresponding path program 1 times [2025-03-17 20:02:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:32,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112871632] [2025-03-17 20:02:32,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:32,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:32,710 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,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:32,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:32,724 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,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:32,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:33,023 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:33,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:33,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:33,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:33,024 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:33,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:33,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:33,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2025-03-17 20:02:33,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:33,024 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:33,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:33,507 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:33,510 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:33,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,513 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,515 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,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,539 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,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,541 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,543 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,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,564 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,565 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,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,585 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,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,587 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,588 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,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,607 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,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,609 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,609 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,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,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,634 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,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,636 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,637 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,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,650 INFO L402 nArgumentSynthesizer]: A total of 0 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,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,659 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,659 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,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 20:02:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,680 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,680 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,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:02:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,704 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,706 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,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:33,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:33,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:33,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,731 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,732 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,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:33,757 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,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,760 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,761 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,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:33,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:33,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:33,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:33,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:33,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:33,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:33,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:33,815 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:02:33,816 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-17 20:02:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:33,821 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,823 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,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:33,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:33,840 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:33,840 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,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:33,861 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 20:02:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:33,902 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,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:33,920 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,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:33,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:33,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:02:33,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:33,923 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,942 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,943 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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 30 states and 48 transitions. Complement of second has 3 states. [2025-03-17 20:02:33,969 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,972 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,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-03-17 20:02:33,978 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,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,979 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,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,979 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,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:33,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 48 transitions. [2025-03-17 20:02:33,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 20:02:33,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 39 transitions. [2025-03-17 20:02:33,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:02:33,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:02:33,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 39 transitions. [2025-03-17 20:02:33,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:33,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 39 transitions. [2025-03-17 20:02:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 39 transitions. [2025-03-17 20:02:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-17 20:02:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 22 states have internal predecessors, (37), 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,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2025-03-17 20:02:33,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 37 transitions. [2025-03-17 20:02:33,998 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 37 transitions. [2025-03-17 20:02:33,998 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:02:33,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 37 transitions. [2025-03-17 20:02:33,998 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 20:02:33,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:33,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:33,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:02:33,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:33,999 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#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,999 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" [2025-03-17 20:02:33,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 81083090, now seen corresponding path program 1 times [2025-03-17 20:02:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707912885] [2025-03-17 20:02:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:02:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:02:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:34,101 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:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707912885] [2025-03-17 20:02:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707912885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:02:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016660619] [2025-03-17 20:02:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:34,104 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:34,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2025-03-17 20:02:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898042001] [2025-03-17 20:02:34,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,110 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,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,115 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,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:34,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:02:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:02:34,151 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. cyclomatic complexity: 18 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,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:34,170 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2025-03-17 20:02:34,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 33 transitions. [2025-03-17 20:02:34,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 20:02:34,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 33 transitions. [2025-03-17 20:02:34,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:02:34,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:02:34,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2025-03-17 20:02:34,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:34,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 20:02:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2025-03-17 20:02:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 20:02:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2025-03-17 20:02:34,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 20:02:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:02:34,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 20:02:34,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:02:34,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2025-03-17 20:02:34,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 20:02:34,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:34,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:34,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 20:02:34,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:02:34,178 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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,178 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" [2025-03-17 20:02:34,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1781391427, now seen corresponding path program 1 times [2025-03-17 20:02:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234742987] [2025-03-17 20:02:34,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:34,190 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:34,196 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,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 2 times [2025-03-17 20:02:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128925358] [2025-03-17 20:02:34,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,203 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,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:34,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:34,205 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,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 611440658, now seen corresponding path program 1 times [2025-03-17 20:02:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811088461] [2025-03-17 20:02:34,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:34,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:34,239 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:34,243 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,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:34,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:02:34,255 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,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:34,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:34,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:34,476 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:34,476 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:34,476 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:34,476 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:34,476 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:34,476 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,476 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:34,476 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:34,476 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2025-03-17 20:02:34,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:34,476 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:34,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [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,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:34,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:34,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,800 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:34,801 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:34,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 20:02:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,822 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,822 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,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,835 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,840 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,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,843 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,844 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,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:34,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,865 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,866 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,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,888 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:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,890 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:34,892 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:34,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:34,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:34,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,917 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:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,919 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:34,920 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:34,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:34,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:34,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,947 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:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,949 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:34,951 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:34,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:34,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:34,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,975 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:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,977 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:34,978 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:34,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:34,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:34,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:34,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:34,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:34,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:34,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:34,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:34,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:34,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:34,998 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:35,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 20:02:35,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:35,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,022 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:35,024 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:35,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,044 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:35,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,047 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:35,048 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:35,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,068 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:35,069 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:35,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:35,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,081 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,086 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:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,088 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:35,089 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:35,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,105 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:35,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,107 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:35,108 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:35,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,125 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:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,127 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:35,128 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:35,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,158 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:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,160 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:35,161 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:35,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,183 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:35,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,185 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:35,186 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:35,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:35,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:35,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:35,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:35,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:35,203 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:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,205 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:35,206 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:35,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:35,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:35,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:35,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:35,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:35,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:35,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:35,245 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 20:02:35,246 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-17 20:02:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,248 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:35,249 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:35,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:35,260 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:02:35,262 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:35,262 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_2) = -1*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_2 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0#1.offset >= 0] [2025-03-17 20:02:35,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 20:02:35,284 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:02:35,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:35,289 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:35,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 20:02:35,322 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,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:02:35,348 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,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,349 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,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-17 20:02:35,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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,371 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 24 states and 35 transitions. Complement of second has 4 states. [2025-03-17 20:02:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-17 20:02:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-17 20:02:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2025-03-17 20:02:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 20:02:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:35,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2025-03-17 20:02:35,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:35,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2025-03-17 20:02:35,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-17 20:02:35,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:02:35,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2025-03-17 20:02:35,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:35,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:02:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2025-03-17 20:02:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 20:02:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 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,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-03-17 20:02:35,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:02:35,374 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:02:35,374 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:02:35,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2025-03-17 20:02:35,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:35,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:35,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:35,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:35,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:35,375 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" [2025-03-17 20:02:35,375 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" [2025-03-17 20:02:35,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1774791227, now seen corresponding path program 1 times [2025-03-17 20:02:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000204274] [2025-03-17 20:02:35,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 20:02:35,389 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,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,450 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000204274] [2025-03-17 20:02:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000204274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:02:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238915141] [2025-03-17 20:02:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:35,451 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2304, now seen corresponding path program 1 times [2025-03-17 20:02:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484601284] [2025-03-17 20:02:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:35,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:35,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:35,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:35,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:35,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 20:02:35,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 20:02:35,492 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:35,504 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-17 20:02:35,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-03-17 20:02:35,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:35,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 34 transitions. [2025-03-17 20:02:35,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:02:35,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:02:35,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-03-17 20:02:35,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:35,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-17 20:02:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-03-17 20:02:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 20:02:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-03-17 20:02:35,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-17 20:02:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 20:02:35,508 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-17 20:02:35,508 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:02:35,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2025-03-17 20:02:35,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:35,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:35,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:35,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:35,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:35,509 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" [2025-03-17 20:02:35,509 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" [2025-03-17 20:02:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -816045744, now seen corresponding path program 1 times [2025-03-17 20:02:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216337458] [2025-03-17 20:02:35,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,740 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,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216337458] [2025-03-17 20:02:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216337458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637535157] [2025-03-17 20:02:35,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:35,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:35,743 INFO L229 MonitoredProcess]: Starting monitored process 33 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,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-17 20:02:35,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:02:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:02:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:35,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 20:02:35,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:35,827 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,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:35,864 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:35,868 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,871 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,904 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,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637535157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:35,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-17 20:02:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999332957] [2025-03-17 20:02:35,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:35,905 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2304, now seen corresponding path program 2 times [2025-03-17 20:02:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446253557] [2025-03-17 20:02:35,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:35,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:35,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:35,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:35,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:35,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:35,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:35,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:35,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 20:02:35,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 20:02:35,940 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. cyclomatic complexity: 14 Second operand has 11 states, 10 states have (on average 1.7) 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:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:36,000 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2025-03-17 20:02:36,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2025-03-17 20:02:36,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:36,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 39 transitions. [2025-03-17 20:02:36,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:36,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:36,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2025-03-17 20:02:36,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:36,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-17 20:02:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2025-03-17 20:02:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-17 20:02:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 24 states have internal predecessors, (35), 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,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2025-03-17 20:02:36,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-17 20:02:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:02:36,003 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-03-17 20:02:36,003 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:02:36,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2025-03-17 20:02:36,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:36,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:36,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:36,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:36,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:36,004 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" [2025-03-17 20:02:36,004 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" [2025-03-17 20:02:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash 472386779, now seen corresponding path program 2 times [2025-03-17 20:02:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569690049] [2025-03-17 20:02:36,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 20:02:36,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:02:36,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:02:36,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:02:36,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2304, now seen corresponding path program 3 times [2025-03-17 20:02:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575559656] [2025-03-17 20:02:36,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:36,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:36,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:36,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:36,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1302837414, now seen corresponding path program 1 times [2025-03-17 20:02:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438400969] [2025-03-17 20:02:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:36,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:36,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438400969] [2025-03-17 20:02:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438400969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078647074] [2025-03-17 20:02:36,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:36,294 INFO L229 MonitoredProcess]: Starting monitored process 34 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:36,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-17 20:02:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:02:36,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:02:36,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:36,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 20:02:36,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:36,383 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:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:36,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:36,428 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:36,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 20:02:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 20:02:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078647074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:36,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-17 20:02:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308222059] [2025-03-17 20:02:36,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:36,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 20:02:36,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-17 20:02:36,481 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. cyclomatic complexity: 14 Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:36,604 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2025-03-17 20:02:36,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 58 transitions. [2025-03-17 20:02:36,604 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2025-03-17 20:02:36,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 58 transitions. [2025-03-17 20:02:36,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-17 20:02:36,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-17 20:02:36,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 58 transitions. [2025-03-17 20:02:36,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:02:36,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-17 20:02:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 58 transitions. [2025-03-17 20:02:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2025-03-17 20:02:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-03-17 20:02:36,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-17 20:02:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:02:36,609 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-17 20:02:36,609 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:02:36,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2025-03-17 20:02:36,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-03-17 20:02:36,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:36,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:36,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:36,610 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:02:36,610 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" [2025-03-17 20:02:36,610 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" [2025-03-17 20:02:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1759089328, now seen corresponding path program 3 times [2025-03-17 20:02:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925054540] [2025-03-17 20:02:36,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-03-17 20:02:36,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:36,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:36,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:36,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2304, now seen corresponding path program 4 times [2025-03-17 20:02:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709588420] [2025-03-17 20:02:36,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-17 20:02:36,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:36,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:36,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:36,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:36,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:36,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1732269073, now seen corresponding path program 2 times [2025-03-17 20:02:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641338689] [2025-03-17 20:02:36,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:36,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 20:02:36,688 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,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:36,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:36,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:36,706 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,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:36,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:37,917 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:37,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:37,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:37,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:37,918 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:37,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:37,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:37,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:37,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2025-03-17 20:02:37,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:37,918 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:37,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:37,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:38,374 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:38,374 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:38,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,376 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:38,377 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:38,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 20:02:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,396 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:38,396 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:38,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 20:02:38,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,418 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:38,418 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:38,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,436 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:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,438 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:38,439 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:38,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,456 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:38,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,458 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:38,458 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:38,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-17 20:02:38,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,479 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:38,479 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:38,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,495 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:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,497 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:38,498 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:38,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:38,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,515 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:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,516 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:38,517 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:38,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,535 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:38,536 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:38,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:02:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,554 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:38,555 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:38,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,576 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:38,577 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:38,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,592 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,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,594 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,596 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,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,612 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,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,614 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,614 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,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,631 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,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,633 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,633 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,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:38,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,651 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,652 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,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,668 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,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,670 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,670 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,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,686 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,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,688 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,689 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,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 20:02:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,707 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,708 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,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:38,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:38,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:38,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,726 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,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,728 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,728 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,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,746 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,747 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,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-17 20:02:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,764 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,765 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,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,781 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,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,783 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:38,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 20:02:38,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-17 20:02:38,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,801 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:38,802 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:38,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,819 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:38,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,820 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:38,821 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:38,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,837 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:38,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,839 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:38,840 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:38,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,856 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:38,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,858 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:38,859 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:38,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,875 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:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,877 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:38,879 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:38,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,896 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:38,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,898 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:38,899 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:38,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,920 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:38,921 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:38,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,938 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:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,941 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:38,942 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:38,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:38,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,964 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:38,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 20:02:38,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:38,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:38,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:38,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:38,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:38,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:38,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:38,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:38,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:38,987 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:38,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-17 20:02:38,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,014 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:39,015 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:39,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:39,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,033 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:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,035 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:39,036 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:39,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:39,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,056 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:39,056 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:39,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:39,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,073 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:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,075 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:39,075 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:39,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:39,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,096 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:39,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,097 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:39,098 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:39,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:39,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,117 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:39,118 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:39,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,135 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:39,136 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:39,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:39,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:39,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,158 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:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,160 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:39,161 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:39,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:02:39,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,179 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:39,179 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:39,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:39,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:39,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:39,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,195 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:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,197 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:39,198 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:39,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:39,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:39,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,215 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:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,217 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:39,220 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:39,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:39,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:39,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:39,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:02:39,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,243 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:39,244 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:39,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:39,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:39,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:39,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:39,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:39,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:39,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:39,273 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 20:02:39,273 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:02:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,276 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:39,276 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:39,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:39,287 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:39,287 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:39,287 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_3, ULTIMATE.start_cstrlen_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_3 - 1*ULTIMATE.start_cstrlen_~s~0#1.offset Supporting invariants [] [2025-03-17 20:02:39,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:39,302 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-03-17 20:02:39,303 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-17 20:02:39,304 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:39,304 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 20:02:39,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 20:02:39,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:39,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 20:02:39,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:39,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:02:39,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:02:39,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:39,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:39,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:39,390 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:39,391 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:39,391 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 46 transitions. Complement of second has 7 states. [2025-03-17 20:02:39,426 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:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-03-17 20:02:39,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2025-03-17 20:02:39,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:39,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 2 letters. [2025-03-17 20:02:39,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:39,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-17 20:02:39,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:39,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2025-03-17 20:02:39,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 20:02:39,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 43 transitions. [2025-03-17 20:02:39,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 20:02:39,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:02:39,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 43 transitions. [2025-03-17 20:02:39,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:39,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2025-03-17 20:02:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 43 transitions. [2025-03-17 20:02:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-17 20:02:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2025-03-17 20:02:39,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-03-17 20:02:39,432 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-03-17 20:02:39,432 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:02:39,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2025-03-17 20:02:39,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 20:02:39,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:39,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:39,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:39,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:39,434 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" [2025-03-17 20:02:39,434 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume cstrstr_~sc~0#1 != cstrstr_~c~0#1;" [2025-03-17 20:02:39,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1733254164, now seen corresponding path program 1 times [2025-03-17 20:02:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129284304] [2025-03-17 20:02:39,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:39,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:39,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 20:02:39,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 20:02:39,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash 63517, now seen corresponding path program 1 times [2025-03-17 20:02:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-03-17 20:02:39,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,468 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,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,469 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,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1277933486, now seen corresponding path program 1 times [2025-03-17 20:02:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756077324] [2025-03-17 20:02:39,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:02:39,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:39,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:39,647 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:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756077324] [2025-03-17 20:02:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756077324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053908105] [2025-03-17 20:02:39,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:39,650 INFO L229 MonitoredProcess]: Starting monitored process 80 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:39,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-17 20:02:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:02:39,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:02:39,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:39,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 20:02:39,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:39,740 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:39,750 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:39,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:39,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-17 20:02:39,787 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:39,789 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:39,805 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:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053908105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:39,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-17 20:02:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273597282] [2025-03-17 20:02:39,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 20:02:39,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 20:02:39,839 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 16 Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:39,916 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-03-17 20:02:39,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2025-03-17 20:02:39,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 20:02:39,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 31 states and 42 transitions. [2025-03-17 20:02:39,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:39,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:39,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-03-17 20:02:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:39,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 20:02:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-03-17 20:02:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 20:02:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-17 20:02:39,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 20:02:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:39,920 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-17 20:02:39,920 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:02:39,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-17 20:02:39,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-03-17 20:02:39,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:39,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:39,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:39,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:02:39,921 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" [2025-03-17 20:02:39,921 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume cstrstr_~sc~0#1 != cstrstr_~c~0#1;" [2025-03-17 20:02:39,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2069589463, now seen corresponding path program 2 times [2025-03-17 20:02:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519056788] [2025-03-17 20:02:39,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 20:02:39,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:39,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:39,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:39,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:39,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 63517, now seen corresponding path program 2 times [2025-03-17 20:02:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842202425] [2025-03-17 20:02:39,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,966 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,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:39,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:39,967 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,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 884191879, now seen corresponding path program 2 times [2025-03-17 20:02:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274385932] [2025-03-17 20:02:39,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:39,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 20:02:39,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:39,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:39,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:39,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:39,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 20:02:39,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 20:02:39,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:39,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:40,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:42,372 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:42,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:42,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:42,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:42,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:42,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:42,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:42,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration9_Lasso [2025-03-17 20:02:42,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:42,373 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:42,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:42,843 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:42,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,845 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:42,847 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:42,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,866 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:42,867 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:42,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:42,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,885 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:42,885 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:42,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,902 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:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,904 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:42,904 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:42,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,921 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:42,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,923 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:42,924 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:42,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,941 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:42,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,942 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:42,943 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:42,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,961 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:42,961 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:42,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:42,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 20:02:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,979 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:42,979 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:42,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:42,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:42,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:42,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:42,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:42,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:42,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:42,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:42,995 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:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:42,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:42,997 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:42,997 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:42,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-03-17 20:02:43,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,017 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:43,018 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:43,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,037 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:43,038 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:43,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,059 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:43,059 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:43,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,079 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:43,080 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:43,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,100 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:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,102 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:43,102 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:43,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-03-17 20:02:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,120 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 20:02:43,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-17 20:02:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,139 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 20:02:43,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,158 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-17 20:02:43,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-03-17 20:02:43,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,177 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-17 20:02:43,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-17 20:02:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,198 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-17 20:02:43,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-17 20:02:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,217 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-17 20:02:43,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-17 20:02:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,236 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 20:02:43,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 20:02:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,256 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-17 20:02:43,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-17 20:02:43,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,274 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-17 20:02:43,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,286 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-17 20:02:43,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,293 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-17 20:02:43,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-17 20:02:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,312 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-17 20:02:43,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-17 20:02:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,331 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-17 20:02:43,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-17 20:02:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,350 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-17 20:02:43,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-03-17 20:02:43,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,392 INFO L229 MonitoredProcess]: Starting monitored process 108 with /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:43,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-17 20:02:43,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,411 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-17 20:02:43,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:43,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-17 20:02:43,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,429 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-17 20:02:43,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:43,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:43,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:43,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-17 20:02:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,456 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-17 20:02:43,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-17 20:02:43,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,479 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-17 20:02:43,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-17 20:02:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,506 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-17 20:02:43,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:43,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,527 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-17 20:02:43,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-17 20:02:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,549 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-17 20:02:43,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-03-17 20:02:43,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,572 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-17 20:02:43,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:43,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-03-17 20:02:43,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,593 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-17 20:02:43,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:43,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-17 20:02:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,613 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-17 20:02:43,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 20:02:43,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,633 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-17 20:02:43,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:43,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:43,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:43,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,653 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-17 20:02:43,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:43,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:43,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:43,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:43,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:43,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:43,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:43,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:43,683 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:43,683 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 20:02:43,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:43,685 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:43,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-17 20:02:43,686 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:43,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:43,696 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:43,696 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_4) = -1*ULTIMATE.start_cstrstr_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_4 Supporting invariants [] [2025-03-17 20:02:43,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-17 20:02:43,716 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 20:02:43,717 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-17 20:02:43,717 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:43,717 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:43,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:43,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:02:43,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:02:43,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:43,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:43,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 20:02:43,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:43,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:02:43,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:02:43,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:43,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:43,783 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:02:43,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:43,801 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:43,801 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:43,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:43,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 59 transitions. Complement of second has 6 states. [2025-03-17 20:02:43,830 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:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2025-03-17 20:02:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-17 20:02:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-17 20:02:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-17 20:02:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:43,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 59 transitions. [2025-03-17 20:02:43,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:43,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2025-03-17 20:02:43,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 20:02:43,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-17 20:02:43,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2025-03-17 20:02:43,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:43,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-17 20:02:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2025-03-17 20:02:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 20:02:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2025-03-17 20:02:43,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-17 20:02:43,833 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-17 20:02:43,833 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:02:43,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2025-03-17 20:02:43,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:43,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:43,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:43,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:43,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:43,834 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:43,834 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -695127033, now seen corresponding path program 1 times [2025-03-17 20:02:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590303393] [2025-03-17 20:02:43,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:02:43,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:02:43,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:43,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590303393] [2025-03-17 20:02:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590303393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:02:43,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:02:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 20:02:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875498291] [2025-03-17 20:02:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:02:43,913 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:43,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 1 times [2025-03-17 20:02:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726447198] [2025-03-17 20:02:43,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:43,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:43,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:43,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:43,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:43,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:43,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:43,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:43,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:43,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:43,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:44,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:02:44,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:02:44,050 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:44,075 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-17 20:02:44,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 66 transitions. [2025-03-17 20:02:44,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:44,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 38 states and 48 transitions. [2025-03-17 20:02:44,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 20:02:44,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 20:02:44,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2025-03-17 20:02:44,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:44,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2025-03-17 20:02:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2025-03-17 20:02:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-03-17 20:02:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-17 20:02:44,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-17 20:02:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:02:44,079 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-17 20:02:44,079 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:02:44,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2025-03-17 20:02:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:44,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:44,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:44,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:44,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:44,080 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:44,080 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:44,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:44,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1972863727, now seen corresponding path program 1 times [2025-03-17 20:02:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488367563] [2025-03-17 20:02:44,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:44,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:02:44,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:44,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:44,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:44,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:44,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:02:44,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:02:44,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:44,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:44,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:44,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 2 times [2025-03-17 20:02:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:44,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628591949] [2025-03-17 20:02:44,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:44,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:44,120 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:44,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:44,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:44,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:44,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:44,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash -119777845, now seen corresponding path program 1 times [2025-03-17 20:02:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335272667] [2025-03-17 20:02:44,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:44,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:02:44,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:44,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:44,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 20:02:44,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335272667] [2025-03-17 20:02:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335272667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126205433] [2025-03-17 20:02:44,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:44,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:44,264 INFO L229 MonitoredProcess]: Starting monitored process 122 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:44,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-03-17 20:02:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:02:44,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:44,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:44,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:44,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-17 20:02:44,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:44,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 20:02:44,397 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:44,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-17 20:02:44,536 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 16 treesize of output 8 [2025-03-17 20:02:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:44,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:44,703 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 20 treesize of output 18 [2025-03-17 20:02:44,705 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 30 treesize of output 26 [2025-03-17 20:02:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:44,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126205433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:44,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 26 [2025-03-17 20:02:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108449734] [2025-03-17 20:02:44,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 20:02:44,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2025-03-17 20:02:44,851 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 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:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:45,181 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-03-17 20:02:45,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 132 transitions. [2025-03-17 20:02:45,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:45,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 65 states and 80 transitions. [2025-03-17 20:02:45,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:45,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:45,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 80 transitions. [2025-03-17 20:02:45,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:45,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-17 20:02:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 80 transitions. [2025-03-17 20:02:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-03-17 20:02:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 58 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2025-03-17 20:02:45,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 74 transitions. [2025-03-17 20:02:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 20:02:45,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 74 transitions. [2025-03-17 20:02:45,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:02:45,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 74 transitions. [2025-03-17 20:02:45,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:45,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:45,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:45,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:45,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:45,191 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:45,191 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:45,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1403278843, now seen corresponding path program 2 times [2025-03-17 20:02:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040708247] [2025-03-17 20:02:45,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:45,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 20:02:45,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:45,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040708247] [2025-03-17 20:02:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040708247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100874355] [2025-03-17 20:02:45,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:45,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:45,475 INFO L229 MonitoredProcess]: Starting monitored process 123 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:45,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-03-17 20:02:45,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 20:02:45,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 20:02:45,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:45,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 20:02:45,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:45,611 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:45,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 20:02:45,645 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 15 treesize of output 15 [2025-03-17 20:02:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:45,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:45,683 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:45,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 20:02:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 20:02:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100874355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:45,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2025-03-17 20:02:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740942930] [2025-03-17 20:02:45,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:45,702 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 3 times [2025-03-17 20:02:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023473785] [2025-03-17 20:02:45,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:45,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:45,710 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:45,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:02:45,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:45,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:45,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:45,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:45,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 20:02:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-03-17 20:02:45,837 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. cyclomatic complexity: 22 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 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:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:46,060 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2025-03-17 20:02:46,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 96 transitions. [2025-03-17 20:02:46,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:46,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 61 states and 76 transitions. [2025-03-17 20:02:46,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:46,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:46,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2025-03-17 20:02:46,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:46,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-17 20:02:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2025-03-17 20:02:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 20:02:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-17 20:02:46,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-17 20:02:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 20:02:46,066 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-17 20:02:46,066 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:02:46,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2025-03-17 20:02:46,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:46,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:46,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:46,067 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:46,067 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:46,067 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:46,067 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:46,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 539731856, now seen corresponding path program 3 times [2025-03-17 20:02:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483905426] [2025-03-17 20:02:46,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:46,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-17 20:02:46,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:46,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:46,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:02:46,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:46,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:46,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 4 times [2025-03-17 20:02:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306260987] [2025-03-17 20:02:46,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:02:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:46,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-17 20:02:46,109 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:46,109 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:02:46,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:46,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1274554570, now seen corresponding path program 2 times [2025-03-17 20:02:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464993883] [2025-03-17 20:02:46,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:46,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 20:02:46,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:02:46,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:46,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:46,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 20:02:46,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 20:02:46,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:46,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:46,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:53,621 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 320 DAG size of output: 249 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:02:54,167 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:02:54,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:02:54,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:02:54,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:02:54,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:02:54,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:54,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:02:54,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:02:54,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration13_Lasso [2025-03-17 20:02:54,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:02:54,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:02:54,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:54,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:02:55,055 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:02:55,055 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:02:55,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,058 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-17 20:02:55,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-17 20:02:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,078 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 20:02:55,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:55,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,098 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-17 20:02:55,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,118 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-17 20:02:55,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,139 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-17 20:02:55,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:55,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,160 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-17 20:02:55,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-17 20:02:55,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,179 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-17 20:02:55,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:55,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:55,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:55,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 20:02:55,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,203 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-17 20:02:55,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,223 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 20:02:55,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-17 20:02:55,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,242 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-17 20:02:55,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,272 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-17 20:02:55,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-17 20:02:55,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,292 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-17 20:02:55,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:02:55,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:02:55,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:02:55,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-17 20:02:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,313 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-17 20:02:55,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:02:55,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:55,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:55,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:02:55,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-03-17 20:02:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,334 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-17 20:02:55,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:55,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:02:55,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:02:55,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:02:55,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:02:55,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:02:55,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:02:55,357 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:02:55,369 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-17 20:02:55,369 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 20:02:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:02:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,371 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:02:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-17 20:02:55,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:02:55,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:02:55,383 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:02:55,383 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1#1.offset, v_rep(select #length ULTIMATE.start_cstrncmp_~s1#1.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1#1.base)_1 Supporting invariants [] [2025-03-17 20:02:55,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-03-17 20:02:55,423 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-03-17 20:02:55,424 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2025-03-17 20:02:55,425 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:02:55,425 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:02:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:55,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:02:55,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:02:55,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:55,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:55,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:02:55,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:55,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:55,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:55,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:55,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 20:02:55,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:55,525 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:55,525 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 20:02:55,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 76 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:55,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 76 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 93 states and 116 transitions. Complement of second has 7 states. [2025-03-17 20:02:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:02:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2025-03-17 20:02:55,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 26 letters. Loop has 4 letters. [2025-03-17 20:02:55,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:55,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 30 letters. Loop has 4 letters. [2025-03-17 20:02:55,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:55,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 26 letters. Loop has 8 letters. [2025-03-17 20:02:55,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:02:55,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 116 transitions. [2025-03-17 20:02:55,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:55,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 78 states and 99 transitions. [2025-03-17 20:02:55,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:55,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:55,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2025-03-17 20:02:55,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:55,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-17 20:02:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2025-03-17 20:02:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-17 20:02:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 73 states have internal predecessors, (95), 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:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-03-17 20:02:55,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-03-17 20:02:55,561 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-03-17 20:02:55,561 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:02:55,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 95 transitions. [2025-03-17 20:02:55,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:55,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:55,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:55,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:55,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:55,562 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#1(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1;" "cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true;" "assume 0 != cstrstr_#t~ret18#1;havoc cstrstr_#t~ret18#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:55,565 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:55,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1004092642, now seen corresponding path program 1 times [2025-03-17 20:02:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045847873] [2025-03-17 20:02:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:02:55,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:55,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:55,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 20:02:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045847873] [2025-03-17 20:02:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045847873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214810063] [2025-03-17 20:02:55,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:55,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:55,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:55,981 INFO L229 MonitoredProcess]: Starting monitored process 139 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:55,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-03-17 20:02:56,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 20:02:56,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 20:02:56,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:56,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:56,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 20:02:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:56,150 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:56,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-03-17 20:02:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 20:02:56,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:56,331 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:56,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-17 20:02:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 20:02:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214810063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:56,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-03-17 20:02:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363773459] [2025-03-17 20:02:56,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:56,361 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:02:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 5 times [2025-03-17 20:02:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568306125] [2025-03-17 20:02:56,361 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:02:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:56,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:56,367 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:56,367 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:02:56,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:56,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:56,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:56,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:56,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:56,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 20:02:56,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-17 20:02:56,497 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. cyclomatic complexity: 30 Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 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:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:56,649 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2025-03-17 20:02:56,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2025-03-17 20:02:56,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:56,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 56 states and 72 transitions. [2025-03-17 20:02:56,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-17 20:02:56,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-03-17 20:02:56,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2025-03-17 20:02:56,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:56,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-03-17 20:02:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2025-03-17 20:02:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 20:02:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 55 states have internal predecessors, (72), 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:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2025-03-17 20:02:56,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-03-17 20:02:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 20:02:56,655 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-03-17 20:02:56,655 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:02:56,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2025-03-17 20:02:56,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:56,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:56,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:56,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:56,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:56,656 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#1(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1;" "cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true;" "assume 0 != cstrstr_#t~ret18#1;havoc cstrstr_#t~ret18#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:56,656 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:56,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1945769453, now seen corresponding path program 2 times [2025-03-17 20:02:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369726453] [2025-03-17 20:02:56,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:56,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 20:02:56,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:02:56,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:56,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 20:02:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 20:02:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:56,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 6 times [2025-03-17 20:02:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793569525] [2025-03-17 20:02:56,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 20:02:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:56,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:56,710 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:56,710 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 20:02:56,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:56,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:56,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:56,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:56,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:56,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -468225587, now seen corresponding path program 1 times [2025-03-17 20:02:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728427572] [2025-03-17 20:02:56,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:56,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:02:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:02:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:02:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728427572] [2025-03-17 20:02:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728427572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:02:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943260834] [2025-03-17 20:02:57,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:02:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:02:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:02:57,244 INFO L229 MonitoredProcess]: Starting monitored process 140 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:57,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-03-17 20:02:57,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 20:02:57,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 20:02:57,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:02:57,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-17 20:02:57,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:02:57,428 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:57,432 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:57,635 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 16 treesize of output 8 [2025-03-17 20:02:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:57,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:02:57,779 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 20 treesize of output 18 [2025-03-17 20:02:57,785 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 30 treesize of output 26 [2025-03-17 20:02:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 20:02:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943260834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:02:57,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:02:57,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2025-03-17 20:02:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454633780] [2025-03-17 20:02:57,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:02:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:02:57,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 20:02:57,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 20:02:57,946 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. cyclomatic complexity: 23 Second operand has 34 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:02:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:02:58,249 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2025-03-17 20:02:58,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 146 transitions. [2025-03-17 20:02:58,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:58,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 111 states and 140 transitions. [2025-03-17 20:02:58,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:02:58,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:02:58,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 140 transitions. [2025-03-17 20:02:58,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:02:58,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 140 transitions. [2025-03-17 20:02:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 140 transitions. [2025-03-17 20:02:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-03-17 20:02:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 97 states have internal predecessors, (127), 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:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-03-17 20:02:58,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-03-17 20:02:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 20:02:58,261 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-03-17 20:02:58,261 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 20:02:58,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 127 transitions. [2025-03-17 20:02:58,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 20:02:58,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:02:58,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:02:58,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:02:58,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:02:58,262 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~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~nondet24#1, main_#t~post25#1, main_~i~0#1, main_#t~nondet26#1, main_#t~post27#1, main_~i~1#1, main_#t~ret28#1.base, main_#t~ret28#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~nondet20#1;main_~length1~0#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1;" "assume main_~i~0#1 < main_~length1~0#1;havoc main_#t~nondet24#1;call write~int#0(main_#t~nondet24#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet24#1;main_#t~post25#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post25#1;havoc main_#t~post25#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~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1;" "assume main_~i~1#1 < main_~length2~0#1;havoc main_#t~nondet26#1;call write~int#1(main_#t~nondet26#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet26#1;main_#t~post27#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post27#1;havoc main_#t~post27#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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, cstrstr_#t~mem17#1, cstrstr_#t~ret18#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int#1(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1;" "assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume 0 != cstrlen_#t~mem2#1;havoc cstrlen_#t~mem2#1;cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset;" "assume true;call cstrlen_#t~mem2#1 := read~int#1(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1);" "assume !(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1;" "assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := cstrlen_~s~0#1.offset - cstrlen_~str#1.offset;cstrstr_#t~ret15#1 := cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;havoc cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1;havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;call cstrncmp_#t~mem8#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem9#1 := read~int#1(cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, 1);cstrncmp_#res#1 := (if cstrncmp_#t~mem8#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem8#1 % 256 % 4294967296 else cstrncmp_#t~mem8#1 % 256 % 4294967296 - 4294967296) - (if cstrncmp_#t~mem9#1 % 256 % 4294967296 <= 2147483647 then cstrncmp_#t~mem9#1 % 256 % 4294967296 else cstrncmp_#t~mem9#1 % 256 % 4294967296 - 4294967296);havoc cstrncmp_#t~mem8#1;havoc cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset;havoc cstrncmp_#t~mem9#1;" "cstrstr_#t~ret18#1 := cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;havoc cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1;assume { :end_inline_cstrncmp } true;" "assume 0 != cstrstr_#t~ret18#1;havoc cstrstr_#t~ret18#1;" "assume true;cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post16#1.base, 1 + cstrstr_#t~post16#1.offset;call cstrstr_#t~mem17#1 := read~int#0(cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem17#1;" "assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post16#1.base, cstrstr_#t~post16#1.offset;havoc cstrstr_#t~mem17#1;" "assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1);" "assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem5#1, cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, cstrncmp_#t~mem6#1, cstrncmp_#t~mem8#1, cstrncmp_#t~pre7#1.base, cstrncmp_#t~pre7#1.offset, cstrncmp_#t~mem9#1, cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, cstrncmp_#t~mem11#1, cstrncmp_#t~pre12#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;" "assume !(0 == cstrncmp_~n#1 % 4294967296);" [2025-03-17 20:02:58,265 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrncmp_#t~mem5#1 := read~int#0(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post4#1.base, 1 + cstrncmp_#t~post4#1.offset;call cstrncmp_#t~mem6#1 := read~int#1(cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset, 1);" "assume !(cstrncmp_#t~mem5#1 != cstrncmp_#t~mem6#1);havoc cstrncmp_#t~mem5#1;havoc cstrncmp_#t~post4#1.base, cstrncmp_#t~post4#1.offset;havoc cstrncmp_#t~mem6#1;cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post10#1.base, 1 + cstrncmp_#t~post10#1.offset;call cstrncmp_#t~mem11#1 := read~int#0(cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset, 1);" "assume !(0 == cstrncmp_#t~mem11#1);havoc cstrncmp_#t~post10#1.base, cstrncmp_#t~post10#1.offset;havoc cstrncmp_#t~mem11#1;cstrncmp_#t~pre12#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1;" "assume 0 != cstrncmp_#t~pre12#1 % 4294967296;havoc cstrncmp_#t~pre12#1;" [2025-03-17 20:02:58,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1072979522, now seen corresponding path program 3 times [2025-03-17 20:02:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416541488] [2025-03-17 20:02:58,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:02:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:58,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-17 20:02:58,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:02:58,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 20:02:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:02:58,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:02:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:58,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1630395, now seen corresponding path program 7 times [2025-03-17 20:02:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200319810] [2025-03-17 20:02:58,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 20:02:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:58,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:58,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:02:58,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:02:58,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:02:58,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:02:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1445766152, now seen corresponding path program 2 times [2025-03-17 20:02:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:02:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593803252] [2025-03-17 20:02:58,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:02:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:02:58,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 20:02:58,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:02:58,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:02:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:02:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 20:02:58,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 20:02:58,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:02:58,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:02:58,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:09,074 WARN L286 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 433 DAG size of output: 332 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-17 20:03:10,201 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:10,201 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:10,201 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:10,201 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:10,201 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:10,201 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:10,201 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:10,201 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:10,201 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration16_Lasso [2025-03-17 20:03:10,201 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:10,201 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:10,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:10,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:11,425 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:11,426 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:11,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,429 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 20:03:11,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:03:11,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,451 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 20:03:11,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-17 20:03:11,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,470 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-17 20:03:11,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,490 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-17 20:03:11,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-17 20:03:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,509 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-17 20:03:11,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:03:11,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-17 20:03:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,528 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-17 20:03:11,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:03:11,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:11,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:11,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:11,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-17 20:03:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,547 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-17 20:03:11,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:03:11,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:03:11,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-17 20:03:11,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,568 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-17 20:03:11,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:03:11,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:03:11,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:11,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-17 20:03:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,590 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 20:03:11,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:03:11,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:11,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:11,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:11,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:11,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:03:11,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:03:11,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:11,617 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:03:11,617 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:03:11,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:11,619 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:03:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-17 20:03:11,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:11,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:03:11,631 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:11,631 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_6, ULTIMATE.start_cstrncmp_~s1#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_6 - 1*ULTIMATE.start_cstrncmp_~s1#1.offset Supporting invariants [] [2025-03-17 20:03:11,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-17 20:03:11,670 INFO L156 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2025-03-17 20:03:11,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2025-03-17 20:03:11,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:03:11,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:03:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:03:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:03:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:11,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:03:11,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:11,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:11,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:11,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:11,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:03:11,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:11,845 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:03:11,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-03-17 20:03:11,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39 Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:11,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Result 120 states and 156 transitions. Complement of second has 10 states. [2025-03-17 20:03:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2025-03-17 20:03:11,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 36 letters. Loop has 4 letters. [2025-03-17 20:03:11,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:11,900 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:03:11,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:11,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:03:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:03:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:11,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:03:11,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:12,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:12,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:12,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:03:12,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:12,094 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:03:12,095 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2025-03-17 20:03:12,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39 Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:12,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Result 117 states and 152 transitions. Complement of second has 10 states. [2025-03-17 20:03:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2025-03-17 20:03:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 36 letters. Loop has 4 letters. [2025-03-17 20:03:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:12,151 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 20:03:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:12,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 20:03:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 20:03:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:12,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 20:03:12,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:03:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:03:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:12,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 20:03:12,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:12,328 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:03:12,328 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-03-17 20:03:12,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39 Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:12,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 127 transitions. cyclomatic complexity: 39. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Result 127 states and 166 transitions. Complement of second has 7 states. [2025-03-17 20:03:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:03:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2025-03-17 20:03:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 36 letters. Loop has 4 letters. [2025-03-17 20:03:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 40 letters. Loop has 4 letters. [2025-03-17 20:03:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 41 transitions. Stem has 36 letters. Loop has 8 letters. [2025-03-17 20:03:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:12,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 166 transitions. [2025-03-17 20:03:12,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:12,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2025-03-17 20:03:12,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:03:12,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:03:12,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:03:12,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:12,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:12,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:12,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:12,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 20:03:12,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:03:12,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:12,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:03:12,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:03:12 BoogieIcfgContainer [2025-03-17 20:03:12,375 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:03:12,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:03:12,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:03:12,375 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:03:12,376 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:03:12,377 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:03:12,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:03:12,378 INFO L158 Benchmark]: Toolchain (without parser) took 40539.29ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 124.5MB in the beginning and 280.7MB in the end (delta: -156.2MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2025-03-17 20:03:12,378 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.22ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 106.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 104.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: Boogie Preprocessor took 34.59ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: IcfgBuilder took 341.00ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 84.4MB in the end (delta: 18.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: BuchiAutomizer took 39887.56ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 84.4MB in the beginning and 280.8MB in the end (delta: -196.4MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:12,379 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 486.5MB. Free memory was 280.8MB in the beginning and 280.7MB in the end (delta: 96.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:03:12,380 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 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.22ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 106.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 104.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.59ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 103.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 341.00ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 84.4MB in the end (delta: 18.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 39887.56ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 84.4MB in the beginning and 280.8MB in the end (delta: -196.4MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 486.5MB. Free memory was 280.8MB in the beginning and 280.7MB in the end (delta: 96.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~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: ~s!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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: ~s1!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 16 terminating modules (10 trivial, 5 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 null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 10 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.8s and 17 iterations. TraceHistogramMax:4. Analysis of lassos took 37.1s. Construction of modules took 0.7s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 2716 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2303 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1720 IncrementalHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 413 mSDtfsCounter, 1720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax109 hnf100 lsp87 ukn70 mio100 lsp32 div155 bol100 ite100 ukn100 eq163 hnf92 smp81 dnf206 smp91 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 20:03:12,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-17 20:03:12,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-03-17 20:03:12,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:12,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2025-03-17 20:03:13,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:13,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:13,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:13,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:13,999 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